Evaluating the EASY-backfill job scheduling of static workloads on clusters
Wong, Adam and Goscinski, Andrzej 2007, Evaluating the EASY-backfill job scheduling of static workloads on clusters, in IEEE International Conference on Cluster Computing Conference Proceedings 2007, IEEE Xplore, Piscataway, N.J., pp. 64-73.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name
Description
MIMEType
Size
Downloads
Title
Evaluating the EASY-backfill job scheduling of static workloads on clusters
IEEE International Conference on Cluster Computing Conference Proceedings 2007
Editor(s)
Milfeld, Kent Paprzycki, Marcin
Publication date
2007
Conference series
International Conference on Cluster Computing
Start page
64
End page
73
Publisher
IEEE Xplore
Place of publication
Piscataway, N.J.
Summary
This research aims at improving our understanding of backfilling job scheduling algorithms. The most frequently used algorithm, EASY-backfilling, was selected for a performance evaluation by scheduling static workloads of parallel jobs on a computer cluster. To achieve the aim, we have developed a batch job scheduler for Linux clusters, implemented several scheduling algorithms including ARCA and EASY-Backfilling, and carried out their performance evaluation by running well known MPI applications on a real cluster. Our performance evaluation carried out for EASY-Backfilling serves two purposes. First, the performance results obtained from our evaluation can be used to validate other researcherspsila results generated by simulation, and second, the methodology used in our evaluation has alleviated many problems existed in the simulations presented in the current literature.