A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters

• Published in: High Performance Computing for Computational Science - VECPAR 2008 pp. 123 - 136
• Main Authors: Barbosa, Jorge, Monteiro, António P.
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2008
• Series: Lecture Notes in Computer Science
• Subjects: cluster computing; list scheduling; parallel task; Static and dynamic scheduling
• ISBN: 3540928588; 9783540928584
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-92859-1_13

This paper addresses the problem of scheduling multi-user jobs on clusters, both homogeneous and heterogeneous. A user job is composed by a set of dependent tasks and it is described by a direct acyclic graph (DAG). The aim is to maximize the resource usage by allowing a floating mapping of processors to a given job, instead of the common mapping approach that assigns a fixed set of processors to a user for a period of time. The simulation results show a better cluster usage. The scheduling algorithm minimizes the total length of the schedule (makespan) of a given set of parallel jobs, whose priorities are represented in a DAG. The algorithm is presented as producing static schedules although it can be adapted to a dynamic behavior as discussed in the paper.