Eliminating partially dead code in explicitly parallel programs

Theoretical Computer Science

Volumn 196, Issue 1-2, 1998, Pages 365-393

  Knoop, Jens ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Interleaving semantics; Parallelism; Partial dead code elimination; Program optimization; Shared memory

Indexed keywords

EID: 0345913534     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00208-9     Document Type: Article

References (30)

1. W.F. Appelbe, B. Lakshmanan, Optimizing parallel programs using affinity regions, in: Proc. Internat. Conf. on Parallel Processing, vol. II, St. Charles, Illinois, 1993, pp. 246-249.
2. J.-H. Chow, W.L. Harrison, State space reduction in abstract interpretation of parallel programs, in: Proc. Internat. Conf. on Computer Languages (ICCL'94), Toulouse, France, 1994, pp. 277-288.
3. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conf. Record of the 4th ACM Symp. on Principles of Programming Languages (POPL'77), Los Angeles, California, ACM, New York, 1977, pp. 238-252.
4. M.B. Dwyer, L.A. Clarke, Data flow analysis for verifying properties of concurrent programs, in: Proc. 2nd ACM SIGSOFT'94 Symp. on Foundations of Software Engineering (SIGSOFT'94), New Orleans, Lousiana, vol. 19, 5 of Software Engineering Notes, ACM, New York, 1994, pp. 62-5.
5. L. Feigen, D. Klappholz, R. Casazza, X. Xue, The revival transformation, in: Conf. Record of the 21st ACM Symp. on Principles of Programming Languages (POPL'94), Portland, Oregon, ACM, New York, 1994, pp. 421-434.
6. A. Geser, J. Knoop, G. Lüttgen, O. Rüthing, B. Steffen, Non-monotone fixpoint iterations to resolve second order effects, in: Proc. 6th Internat. Conf. on Compiler Construction (CC'96), Linköping, Sweden, Lecture Notes in Computer Science, vol. 1060, Springer, Heidelberg, 1996, pp. 106-120.
7. D. Grunwald, H. Srinivasan, Data flow equations for explicitly parallel programs, in: Proc. ACM SIGPLAN Symp. on Principles of Parallel Programming (PPOPP'93), vol. 28,7 of ACM SIGPLAN Notices, 1993, pp. 159-168.
8. M.S. Hecht, Flow Analysis of Computer Programs, Elsevier, Amsterdam, 1977.
9. J.B. Kam, J.D. Ullman, Monotone data flow analysis frameworks, Acta Inform. 7 (1977) 309-317.
10. J. Knoop, O. Rüthing, B. Steffen, Lazy code motion, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'92), San Francisco, California, vol. 27,7 of ACM SIGPLAN Notices, 1992, pp. 224-234.
11. J. Knoop, O. Rüthing, B. Steffen, Optimal code motion: theory and practice, ACM Trans. on Programming Languages and Systems 16(4) (1994) 1117-1155.
12. J. Knoop, O. Rüthing, B. Steffen, Partial dead code elimination, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'94), Orlando, Florida, vol. 29,6 of ACM SIGPLAN Notices, 1994, pp. 147-158.
13. J. Knoop, O. Rüthing, B. Steffen, The power of assignment motion, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'95), La Jolla, California, vol. 30,6 of ACM SIGPLAN Notices, 1995, pp. 233-245.
14. J. Knoop, B. Steffen, The interprocedural coincidence theorem, in: Proc. 4th Internat. Conf. on Compiler Construction (CC'92), Paderborn, Germany, Lecture Notes in Computer Science, vol. 641, Springer, Heidelberg, 1992, pp. 125-140.
15. J. Knoop, B. Steffen, J. Vollmer, Parallelism for free: efficient and optimal bitvector analyses for parallel programs. ACM Trans. on Programming Languages and Systems 18 (3) (1996) 268-299.
16. A. Krishnamurthy, K. Yelick, Optimizing parallel programs with explicit synchronization, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'95), La Jolla, California, vol. 30, 6 of ACM SIGPLAN Notices, 1995, pp. 196-204.
17. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput. C-28 (9) (1979) 690-691.
18. D. Long, L. Clarke, Data How analysis of concurrent systems that use the rendezvous model of synchronization, in: Proc. ACM SIGSOFT Symp. on Testing, Analysis, and Verification (TAV'91), Software Eng. Notes, vol. 16, 1991, pp. 21-35.
19. K. Marriot, Frameworks for abstract interpretation, Acta Inform. 30 (1993) 103-129.
20. S.P. Midkiff, D.A. Padua, Issues in the optimization of parallel programs, in: Proc. Internat. Conf. on Parallel Processing, vol. II, St. Charles, Illinois, 1990, pp. 105-113.
21. S.S. Muchnick, N.D. Jones (Eds ), Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1981.
22. M.H.A. Newman, On theories with a combinatorial definition of equivalence, Ann. Math. 43 (2) (1942) 223-243.
23. M. Sharir, A. Pnueli, Two approaches to interprocedural data flow analysis, in: S.S. Muchnick, N.D. Jones (Eds.), Program Flow Analysis: Theory and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1981, chap. 7, pp. 189-233.
24. D. Shasha, M. Snir, Efficient and correct execution of parallel programs that share memory, ACM Trans. on Programming Languages and Systems 10 (2) (1988) 282-312.
25. H. Srinivasan, J. Hook, M. Wolfe, Static single assignment form for explicitly parallel programs, in: Conf. Record of the 20th ACM Symp. on Principles of Programming Languages (POPL'93), Charleston, South Carolina, ACM, New York, 1993, pp. 260-272.
26. H. Srinivasan, M. Wolfe, Analyzing programs with explicit parallelism, in: Proc. 4th Internat. Conf. on Languages and Compilers for Parallel Computing (LCPC'91), Santa Clara, California, Lecture Notes in Computer Science, vol. 589, Springer, Heidelberg, 1991, pp. 405-419.
27. J. Vollmer, Data flow analysis of parallel programs, in: Proc. IFIP WG 10.3 Working Conf. on Parallel Architectures and Compilation Techniques (PACT'95), Limassol, Cyprus, 1995, pp. 168-177.
28. M. Wolfe, High performance compilers for parallel computing, Addison-Wesley, Redwood City, California, 1996.
29. M. Wolfe, H. Srinivasan, Data structures for optimizing programs with explicit parallelism, in: Proc. 1st Internat. Conf. of the Austrian Center for Parallel Computation, Lecture Notes in Computer Science, vol. 591, Springer, Heidelberg, 1991, pp. 139-156.
30. H. Zima, B. Chapman, Supercompilers for Parallel and Vector Computers, Addison-Wesley, ACM Press, New York, 1991.