Resource-aware adaptive scheduling for MapReduce clusters

103Citations
Citations of this article
87Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a resource-aware scheduling technique for MapReduce multi-job workloads that aims at improving resource utilization across machines while observing completion time goals. Existing MapReduce schedulers define a static number of slots to represent the capacity of a cluster, creating a fixed number of execution slots per machine. This abstraction works for homogeneous workloads, but fails to capture the different resource requirements of individual jobs in multi-user environments. Our technique leverages job profiling information to dynamically adjust the number of slots on each machine, as well as workload placement across them, to maximize the resource utilization of the cluster. In addition, our technique is guided by user-provided completion time goals for each job. Source code of our prototype is available at [1]. © 2011 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Polo, J., Castillo, C., Carrera, D., Becerra, Y., Whalley, I., Steinder, M., … Ayguadé, E. (2011). Resource-aware adaptive scheduling for MapReduce clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7049 LNCS, pp. 187–207). https://doi.org/10.1007/978-3-642-25821-3_10

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