The tao of parallelism in algorithms
- 4 June 2011
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 46 (6), 12-25
- https://doi.org/10.1145/1993316.1993501
Abstract
No abstract availableThis publication has 44 references indexed in Scilit:
- Fractal symbolic analysisACM Transactions on Programming Languages and Systems, 2003
- Speculative Versioning CacheIEEE Transactions on Parallel and Distributed Systems, 2001
- The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelizationIEEE Transactions on Parallel and Distributed Systems, 1999
- Programming parallel algorithmsCommunications of the ACM, 1996
- CilkACM SIGPLAN Notices, 1995
- Distributed memory compiler design for sparse problemsInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1995
- The combining DAG: a technique for parallel data flow analysisIEEE Transactions on Parallel and Distributed Systems, 1994
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992
- Parallelizing programs with recursive data structuresIEEE Transactions on Parallel and Distributed Systems, 1990
- Efficient demand-driven evaluation. Part 1ACM Transactions on Programming Languages and Systems, 1985