Parallelizing compilers have-traditionally focussed mainly on parallelizing loops. This paper presents a new framework for automatically parallelizing recursive Procedures the at typically appear in divide-and-conquer algorithms. We present Compile-time analysis, using powerful, symbolic array section analysis, to detect The independence of multiple recursive calls in a procedure. This allows exploita- Tion of a scalable form of nested parallelism, where each parallel task can further Spawn off parallel work in subsequent recursive calls.
展开▼
