Automatic parallelization of divide- and-conquer algorithms
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.
- 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