Automatic parallelization of divide-and-conquer algorithms

Abstract

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.