Queuing-oriented job optimizing scheduling in cloud mapreduce

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud MapReduce, as an implementation of MapReduce framework on Cloud for big data analysis, is facing the unknown job makespan and long wait time problem, which have seriously affected the service quality. The Inefficient virtual machine allocation is one critical causing factor. Based on the M/M/1 model, a new queuing equation is built to ensure the virtual machine with the high efficiency. By jointing queuing equation and objectives function, a two variables equation group is designed to compute the desired virtual machine number for different jobs. According to the desired virtual machine number of each job, we developed a queuing-oriented job optimizing scheduling algorithm, called QTJS, to optimal job scheduling and enhance the resource utilization in Cloud MapReduce. Extensive experiments show that our QTJS algorithm consumes less job execution time and performs better efficiency than other three algorithms.

Cite

CITATION STYLE

APA

He, T. Q., Cai, L. J., Deng, Z. Y., Meng, T., & Wang, X. A. (2017). Queuing-oriented job optimizing scheduling in cloud mapreduce. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 1, pp. 435–446). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-49109-7_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free