On-line adaptive parallel prefix computation

Authors:
Jean-Louis Roch;Daouda Traoré;Julien Bernard
Affiliations:
Laboratoire d'Informatique de Grenoble, Équipe MOAIS (CNRS-INRIA-INPG-UJF), Montbonnot Saint Martin, France;Laboratoire d'Informatique de Grenoble, Équipe MOAIS (CNRS-INRIA-INPG-UJF), Montbonnot Saint Martin, France;Laboratoire d'Informatique de Grenoble, Équipe MOAIS (CNRS-INRIA-INPG-UJF), Montbonnot Saint Martin, France
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 6
Cited 5

The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints

IEEE Transactions on Computers
The implementation of the Cilk-5 multithreaded language

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Parallel Prefix Computation

Journal of the ACM (JACM)
New bounds for parallel prefix circuits

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
High-Speed Parallel-Prefix VLSI Ling Adders

IEEE Transactions on Computers
A checkpoint/recovery model for heterogeneous dataflow computations using work-stealing

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography

Proceedings of the 2007 international workshop on Parallel symbolic computation
Probabilistic certification of divide & conquer algorithms on global computing platforms: application to fault-tolerant exact matrix-vector product

Proceedings of the 2007 international workshop on Parallel symbolic computation
Reconfigurable hardware solution to parallel prefix computation

The Journal of Supercomputing
Building Secure Resources to Ensure Safe Computations in Distributed and Potentially Corrupted Environments

Euro-Par 2008 Workshops - Parallel Processing
Work stealing for time-constrained octree exploration: application to real-time 3D modeling

EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization

Quantified Score

Hi-index	0.00

Visualization

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.