BEAUMONT, Olivier; LEGRAND, Arnaud; ROBERT, Yves

doi:10.1109/EMPDP.2003.1183590

Métadonnées

Licence d’utilisation du document

BEAUMONT, Olivier
Algorithms and high performance computing for grand challenge applications [SCALAPPLIX]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

LEGRAND, Arnaud
Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL]

ROBERT, Yves
Algorithms and Scheduling for Distributed Heterogeneous Platforms [GRAAL]

Langue

Communication dans un congrès

Ce document a été publié dans

PDP'2003, 11th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, 2003-02-05, Gênes. 2003p. 209―216

IEEE Computer Society Press

Résumé en anglais

We consider the execution of a complex application on a heterogeneous "Grid" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, each problem consists of a set of tasks. There are dependences (precedence constraints) between these tasks. A typical example is the repeated execution of the same algorithm on several distinct data samples. We use a non-oriented graph to model the Grid platform, where resources have different speeds of computation and communication. We show how to determine the optimal steady-state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). This result holds for a quite general framework, allowing for cycles and multiple paths in the platform graph.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Scheduling Strategies for Mixed Data and Task Parallelism on Heterogeneous Clusters and Grids

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche