Sciweavers

Share
PPOPP
1999
ACM

Automatic Parallelization of Divide and Conquer Algorithms

9 years 8 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory hierarchies. But these algorithms pose challenging problems for parallelizing compilers. They are usually coded as recursive procedures and often use pointers into dynamically allocated memory blocks and pointer arithmetic. All of these features are incompatible with the analysis algorithms in traditional parallelizing compilers. This paper presents the design and implementation of a compiler that is designed to parallelize divide and conquer algorithms whose subproblems access disjoint regions of dynamically allocated arrays. The foundation of the compiler is a ow-sensitive, context-sensitive, and interprocedural pointer analysis algorithm. A range of symbolic analysis algorithms build on the pointer analysis information to extract symbolic bounds for the memory regions accessed by potentially recursive p...
Radu Rugina, Martin C. Rinard
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where PPOPP
Authors Radu Rugina, Martin C. Rinard
Comments (0)
books