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. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Barbosa, J., & Monteiro, A. P. (2008). A list scheduling algorithm for scheduling multi-user jobs on clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 123–136). https://doi.org/10.1007/978-3-540-92859-1_13
Mendeley helps you to discover research relevant for your work.