Skip to Main content Skip to Navigation
Conference papers

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
LIG - Laboratoire d'Informatique de Grenoble, Inria Grenoble - Rhône-Alpes
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.
Document type :
Conference papers
Complete list of metadata
Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Thursday, April 19, 2012 - 11:13:57 AM
Last modification on : Thursday, October 21, 2021 - 3:50:54 AM

Links full text



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



Les métriques sont temporairement indisponibles