On-Line Adaptive Parallel Prefix Computation

  • Jean-Louis Roch
  • Daouda Traoré
  • Julien Bernard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4128)


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.


Execution Time Parallel Algorithm Critical Path Adaptive Algorithm Sequential Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dimitrakopoulos, G., Nikolos, D.: High-speed parallel-prefix vlsi ling adders. IEEE Trans. Computers 54(2), 225–231 (2005)CrossRefGoogle Scholar
  2. 2.
    Wang, H., Nicolau, A., Siu, K.Y.S.: The strict time lower bound and optimal schedules for parallel prefix with resource constraints. IEEE Trans. Comput. 45(11), 1257–1271 (1996)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Ladner, R., Fischer, M.: Parallel prefix computation. J. ACM 27(4), 831–838 (1980)MATHCrossRefMathSciNetGoogle Scholar
  4. 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. 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. 6.
    MOAIS Project: KAAPI homepage (since 2005), http://gforge.inria.fr/projects/kaapi/
  7. 7.
    Bender, M.A., Rabin, M.O.: Online scheduling of parallel programs on heterogeneous systems with applications to cilk. Theory Comput. Syst. 35(3), 289–304 (2002)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Daoudi, E.M., Gautier, T., Kerfali, A., Revire, R., Roch, J.L.: Algorithmes parallèles à grain adaptatif et applications. TSI 24, 1–20 (2005)CrossRefGoogle Scholar
  9. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jean-Louis Roch
    • 1
  • Daouda Traoré
    • 1
  • Julien Bernard
    • 1
  1. 1.Laboratoire d’Informatique de GrenobleÉquipe MOAIS (CNRS-INRIA-INPG-UJF)Montbonnot Saint MartinFrance

Personalised recommendations