| Title | A list scheduling algorithm for scheduling multi-user jobs on clusters |
| Publication Type | Book |
| Year of Publication | 2008 |
| Authors | Barbosa, J, Monteiro, AP |
| Series Title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Lect. Notes Comput. Sci. |
| Volume | 5336 LNCS |
| Number of Pages | 123 - 136 |
| City | Toulouse |
| ISBN Number | 03029743 (ISSN); 3540928588 (ISBN); 9783540928584 (ISBN) |
| Keywords | Cluster computing, Dynamic behaviors, Electric load shedding, High performance liquid chromatography, List scheduling, Paper addresses, Parallel algorithms, Parallel task, Resource usage, Scheduling, Scheduling algorithms, Simulation results, Static and dynamic scheduling, Total length |
| Abstract | 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. |
| URL | http://www.scopus.com/inward/record.url?eid=2-s2.0-58449125218&partnerID=40&md5=2287e7e01d8bab29c2c0bea44372233b |
