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

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2008

Autores

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

Ata de Conferência Internacional

Título: High Performance Computing for Computational Science — VECPAR 2008, Revised Selected Papers

Páginas: 123-136

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

Toulouse, France, June 24-27, 2008

Indexação

ISI Proceedings

INSPEC

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

CORDIS: Ciências Tecnológicas > Engenharia > Engenharia de computadores

Outras Informações

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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica