Basic compiler algorithms for parallel programs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 8, 1999, Pages 1-12

  Lee, Jaejin ^a   Padua, David A ^a   Midkiff, Samuel P ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844394830     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/329366.301105     Document Type: Article

References (34)

1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986.
2. Bowen Alpern, Mark N. Wegman, and F. Kenneth Zadeck. Detecting equality of variables in programs. In Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, pages 1-11, January 1988.
3. Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, New York, 1998.
4. David Callahan, Ken Kennedy, and Jaspal Subhlok. Analysis of event synchronization in a parallel programming tool. In Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), pages 21-30, March 1990.
5. Jong-Deok Choi and Sang Lyul Min. Race frontier: Reproducing data races in parallel-program debugging. In Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), pages 145-154, April 1991.
6. Keith Cooper and Taylor Simpson. SCC-based value numbering. Technical Report CRPC-TR95636-S, Center for Research on Parallel Computation, Rice University, October 1995.
7. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, and Mark N. Wegman. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
8. Perry A. Emrath, Sanjoy Ghosh, and David A. Padua. Event synchronization analysis for debugging parallel programs. In Proceedings of Supercomputing '89, pages 580-588, 1989.
9. Perry A. Emrath, Sanjoy Ghosh, and David A. Padua. Detecting nondeterminacy in parallel programs. IEEE Software, pages 69-77, January 1992.
10. Jeanne Ferrante, Karl J. Ottenstein, and Joe D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, July 1987.
11. The Parallel Computing Forum. PCF parallel fortran extensions. Fortran Forum, 10(3), September 1991.
12. Mark D. Hill. Multiprocessors should support simple memory-consistency models. IEEE Computer, pages 28-34, August 1998.
13. Jens Knoop. Eliminating partially dead code in explicitly parallel programs. Theoretical Computer Science, 196(1-2):365-393, April 1998.
14. Jens Knoop, Bernhard Steffen, and Jürgen Vollmer. Parallelism for free: Efficient and optimal bitvector analysis for parallel programs. ACM Transactions on Programming Languages and Systems, 18(3):268-299, May 1996.
15. Arvind Krishnamurthy and Katherine Yelick. Optimizing parallel SPMD programs. In Seventh Annual Workshop on Languages and Compilers for Parallel Computing, August 1994.
16. Arvind Krishnamurthy and Katherine Yelick. Optimizing parallel programs with explicit synchronization. In Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation (PLDI), pages 196-204, June 1995.
17. Arvind Krishnamurthy and Katherine Yelick. Analyses and optimizations for shared address space programs. Journal of Parallel and Distributed Computing, 38:139-144, 1996.
18. Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690-691, September 1979.
19. Jaejin Lee. Compilation Techniques for Parallel Shared Memory Programs. PhD thesis, University of Illinois at Urbana-Champaign, 1999. In preparation.
20. Jaejin Lee, Samuel P. Midkiff, and David A. Padua. Concurrent static single assignment form and concurrent sparse conditional constant propagation for explicitly parallel programs. Technical Report TR#1525, CSRD, University of Illinois at Urbana-Champaign, July 1997.
21. Jaejin Lee, Samuel P. Midkiff, and David A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In Proceedings of The 10th International Workshop on Languages and Compilers for Parallel Computing, number 1366 in Lecture Notes in Computer Science, pages 114-130. Springer, August 1997.
22. Jaejin Lee, Samuel P. Midkiff, and David A. Padua. A constant propagation algorithm for explicitly parallel programs. International Journal of Parallel Programming, 26(5):563-589, 1998.
23. Samuel. P. Midkiff and David. A. Padua. Issues in the optimization of parallel programs. In Proceedings of the 1990 International Conference on Parallel Processing (ICPP), Vol. II Software, pages 105-113, August 1990.
24. Samuel P. Midkiff, David A. Padua, and Ron Cytron. Compiling programs with user parallelism. In Languages and Compilers for Parallel Computing, pages 402-422, 1990.
25. Steven S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
26. Vivek Sarkar. Analysis and optimization of explicitly parallel programs using the parallel program graph representation. In The Tenth Annual Workshop on Languages and Compilers for Parallel Computing, number 1366 in Lecture Notes in Computer Science, pages 94-113. Springer, August 1997.
27. Vivek Sarkar and Barbara Simons. Parallel program graphs and their classification. In The Sixth Annual Workshop on Languages and Compilers for Parallel Computing, volume 768 of Lecture Notes in Computer Science. Springer-Verlag, August 1993.
28. Dennis Shasha and Marc Snir. Efficient and correct execution of parallel programs that share memory. ACM Transactions on Programming Languages and Systems, 10(2):282-312, April 1988.
29. Loren Taylor Simpson. Value-Driven Redundancy Elimination. PhD thesis, Department of Electrical and Computer Engineering, Rice University, April 1996.
30. Harini Srinivasan. Optimizing explicitly parallel programs. Master's thesis, Department of Computer Science and Engineering, Oregon Graduate Institute of Science and Technology, July 1994.
31. Harini Srinivasan and Dirk Grunwald. An efficient construction of parallel static single assignment form for structured parallel programs. Technical Report CU-CS-564-91, University of Colorado at Boulder, December 1991.
32. Harini Srinivasan, James Hook, and Michael Wolfe. Static single assignment for explicitly parallel programs. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages (POPL), pages 260-272, January 1993.
33. Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.
34. Michael Wolfe and Harini Srinivasan. Data structures for optimizing programs with explicit parallelism. In Proceeedings of the First International Conference of the Austrian Center for Parallel Computation, September 1991.