Automatic parallelization of divide and conquer algorithms
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (8), 72-83
- https://doi.org/10.1145/301104.301111
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Pointer analysis for multithreaded programsPublished by Association for Computing Machinery (ACM) ,1999
- Predicated array data-flow analysis for run-time parallelizationPublished by Association for Computing Machinery (ACM) ,1998
- Solving shape-analysis problems in languages with destructive updatingACM Transactions on Programming Languages and Systems, 1998
- Commutativity analysisPublished by Association for Computing Machinery (ACM) ,1996
- Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in CPublished by Association for Computing Machinery (ACM) ,1996
- CilkPublished by Association for Computing Machinery (ACM) ,1995
- Context-sensitive interprocedural points-to analysis in the presence of function pointersPublished by Association for Computing Machinery (ACM) ,1994
- An implementation of interprocedural bounded regular section analysisIEEE Transactions on Parallel and Distributed Systems, 1991
- Analysis of pointers and structuresPublished by Association for Computing Machinery (ACM) ,1990
- Parallelizing programs with recursive data structuresIEEE Transactions on Parallel and Distributed Systems, 1990