Basic compiler algorithms for parallel programs
- 1 May 1999
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (8), 1-12
- https://doi.org/10.1145/301104.301105
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Multiprocessors should support simple memory consistency modelsComputer, 1998
- Eliminating partially dead code in explicitly parallel programsTheoretical Computer Science, 1998
- Analyses and Optimizations for Shared Address Space ProgramsJournal of Parallel and Distributed Computing, 1996
- Parallelism for freeACM Transactions on Programming Languages and Systems, 1996
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- PCF parallel Fortran extensionsACM SIGPLAN Fortran Forum, 1991
- Race FrontierPublished by Association for Computing Machinery (ACM) ,1991
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- Efficient and correct execution of parallel programs that share memoryACM Transactions on Programming Languages and Systems, 1988
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987