Dynamic job scheduling on heterogeneous clusters

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

Autores

J. Barbosa (Autor) FEUP; Belmiro Moreira (Autor) FEUP

Ata de Conferência Internacional

Título: International Symposium on Parallel and Distributed Computing, IEEE CS

Páginas: 3-10

8th International Symposium on Parallel and Distributed Computing

Lisboa, 30 Junho a 4 Julho de 2009

Indexação

ISI Proceedings

ISI Web of Science

Scopus

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

DOI: 10.1109/ISPDC.2009.19

Abstract (EN): This paper addresses the problem of scheduling dynamically multi-user and independent jobs on clusters, both homogeneous and heterogeneous. The dynamic behavior means that the scheduler is able to adapt the scheduling when new jobs are submitted and also when processors availability changes. The scheduler has two main features comparing to other solutions: it considers a job as being described by a direct acyclic graph (DAG) and it is able to schedule parallel tasks, when appropriate, instead of the common dynamic mapping approach that assigns an entire job to a processor or a fixed set of processors. The scheduling method is divided in a scheduling strategy and a scheduler algorithm, so that other scheduling algorithms can be incorporated. In this paper two static DAG schedulers for heterogeneous machines are considered. The results show the behavior of the scheduling method for the short completion time of a batch of jobs. These results show better performance when compared to the common schedulers strategies that fix the number of processors per job or assign one processor per job.

Idioma: Inglês

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

Nº de páginas: 8