1-optimality of static BSP computations: scheduling independent chains as a case study

Alfredo Goldman 1, 2 Grégory Mounié 1, 2 Denis Trystram 1, 2
2 APACHE - Parallel algorithms and load sharing
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
Abstract : The aim of this work is to study a specific scheduling problem under the machine-independent model BSP. The problem of scheduling a set of independent chains in this context is shown to be a difficult optimization problem, but it can be easily approximated in practice. Efficient heuristics taking into account communications are proposed and analyzed in this paper. We particularly focus on the influence of synchronization between consecutive supersteps. A family of algorithms is proposed with the best possible load-balancing. Then, a strategy for determining a good compromise between the two opposite criteria of minimizing the number of supersteps and a good balance of the load is derived. Finally, a heuristic which considers the influence of the latency is presented. Simulations of a large number of instances have been carried out to complement the theoretical worst case analysis. They confirm the very good behavior of the algorithms on the average cases.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2003, 290 (3), pp.1331-1359
Liste complète des métadonnées

Contributeur : Grégory Mounié <>
Soumis le : jeudi 20 janvier 2005 - 14:59:49
Dernière modification le : vendredi 21 décembre 2018 - 10:46:07
Document(s) archivé(s) le : jeudi 1 avril 2010 - 17:18:36


  • HAL Id : hal-00003954, version 1




Alfredo Goldman, Grégory Mounié, Denis Trystram. 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Science, Elsevier, 2003, 290 (3), pp.1331-1359. 〈hal-00003954〉



Consultations de la notice


Téléchargements de fichiers