Hybrid job scheduling for improved cluster utilization

1Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In This paper, we investigate The models and issues as well as performance benefits of hybrid job scheduling over shared physical clusters. Clustering Technologies That are currently supported include MPI, Hadoop-MapReduce and NoSQL systems. Our proposed scheduling model is above The cluster-specific middleware and OS-level schedulers and it is complementary To Them. First, we demonstrate That we can effectively schedule MPI, Hadoop, NoSQL jobs Together by profiling Them and Then co-scheduling. Second, we find That it is better To schedule cluster jobs with different job characteristics Together (CPU vs. I/O intensive) rather Than Two CPU-intensive jobs. Third, we use The learning outcome of This principle To design of a greedy sort-merge scheduler. Up To 37% savings in Total job completion Times are demonstrated. These savings are directly proportional To The cluster utilization improvements. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ari, I., & Kocak, U. (2014). Hybrid job scheduling for improved cluster utilization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8374 LNCS, pp. 395–405). Springer Verlag. https://doi.org/10.1007/978-3-642-54420-0_39

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