On-Line Adaptive Parallel Prefix Computation
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.
KeywordsExecution Time Parallel Algorithm Critical Path Adaptive Algorithm Sequential Algorithm
Unable to display preview. Download preview PDF.
- 4.Fich, F.E.: New bounds for parallel prefix circuits. In: STOC 1983: Proceedings of the 15th ACM symp. Theory of computing, pp. 100–109. ACM Press, New York (1983)Google Scholar
- 5.Jafar, S., Gautier, T., Krings, A.W., Roch, J.L.: A checkpoint/recovery model for heterogeneous dataflow computations using work-stealing. In: Springer-Verlag, L. (ed.) EUROPAR 2005, Lisboa, Portogal (2005)Google Scholar
- 6.MOAIS Project: KAAPI homepage (since 2005), http://gforge.inria.fr/projects/kaapi/
- 9.Frigo, M., Leiserson, C.E., Randall, K.H.: The Implementation of the Cilk-5 Multithreaded Language. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 1998) (1998)Google Scholar