A list scheduling algorithm for scheduling multi-user jobs on clusters

• Type: Article in International Conference Proceedings Book
• Date: 2008

Authors

Jorge Manuel Gomes Barbosa (Author) FEUP; António Miguel Pontes Pimenta Monteiro (Author) FEUP

Conference proceedings International

Title: High Performance Computing for Computational Science — VECPAR 2008, Revised Selected Papers

Pages: 123-136

VECPAR 2008, 8th International Conference, High Performance Computing for Computational Science

Toulouse, France, June 24-27, 2008

Indexing

ISI Proceedings

INSPEC

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Engineering > Computer engineering

Other information

Abstract (EN): 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.

Language: English

Type (Professor's evaluation): Scientific