Job scheduling in hadoop is a hot topic, however, current research mainly focuses on the time optimization in scheduling. With the trend of providing hadoop as a service to the public or specified groups, more factors should be considered, such as time and cost. To solve this problem, we present a utility-driven share scheduling algorithm. Considering time and cost, algorithm offers a global optimization scheduling scheme according to the workload of the job. Furthermore, we present a model that can estimate job execute time by cost. Finally, we implement the algorithm and experiment it in a hadoop cluster. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Wan, C., Wang, C., Yuan, Y., Wang, H., & Song, X. (2013). Utility-driven share scheduling algorithm in Hadoop. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7952 LNCS, pp. 560–568). Springer Verlag. https://doi.org/10.1007/978-3-642-39068-5_67
Mendeley helps you to discover research relevant for your work.