Automatic parallelization of divide- and-conquer algorithms

  • Bernd Freisleben
  • Thilo Kielmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


In this paper we present a system that automatically partitions sequential divide- and-conquer algorithms programmed in C into independent tasks, maps these to a MEIKO transputer system and executes them in parallel. The feasibility of our approach is illustrated by parallelizing several example algorithms and measuring the resulting performance speedups.


  1. 1.
    G. R. Andrews. Paradigms for Process Interaction in Distributed Programs. ACM Computing Surveys, 23(1):49–90, 1991.CrossRefGoogle Scholar
  2. 2.
    V. M. Lo, S. Rajopadhye, S. Gupta, D. Keldsen, M. Mohamed and J. Telle. Mapping Divide-and-Conquer Algorithms to Parallel Architectures. In International Conference on Parallel Processing, Vol. III, pages 128–135, CRC Press, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Bernd Freisleben
    • 1
  • Thilo Kielmann
    • 1
  1. 1.Department of Computer Science (FB 20)University of DarmstadtDarmstadtGermany

Personalised recommendations