On-line adaptive parallel prefix computation

Jean-Louis Roch 1 Daouda Traoré 1 Julien Bernard 1
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower bound for this problem. We introduce a new adaptive algorithm which is based on the on-line recursive coupling of an optimal sequential algorithm and a parallel one, non-optimal but recursive and fine-grain. The coupling relies on a work-stealing scheduling. Its theoretical performance is analysed on p processors of different and changing speeds. It is close to the lower bound both on identical processors and close to the lower bound for processors of changing speeds. Experiments performed on an eight-processor machine confirms this theoretical result.
Type de document :
Communication dans un congrès
Springer. Euro-Par 2006, Aug 2006, Dresdren, Germany. Springer, 4128, pp.841-850, 2006, LNCS. 〈10.1007/11823285_88〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00689026
Contributeur : Ist Rennes <>
Soumis le : jeudi 19 avril 2012 - 11:13:57
Dernière modification le : mercredi 11 avril 2018 - 01:56:10

Lien texte intégral

Identifiants

Collections

Citation

Jean-Louis Roch, Daouda Traoré, Julien Bernard. On-line adaptive parallel prefix computation. Springer. Euro-Par 2006, Aug 2006, Dresdren, Germany. Springer, 4128, pp.841-850, 2006, LNCS. 〈10.1007/11823285_88〉. 〈hal-00689026〉

Partager

Métriques

Consultations de la notice

179