Parallel constant propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1470 LNCS, Issue , 1998, Pages 445-455

  Knoop, Jens ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT PROPAGATION; IMPLEMENTATION AND COMPUTATION; OPTIMIZERS; PARALLEL PROGRAM; SEQUENTIAL PROGRAMS; STATE EXPLOSION PROBLEMS; STATE OF THE ART; STILL MISSING;

ARTIFICIAL INTELLIGENCE;

EID: 84882684106     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057887     Document Type: Conference Paper

References (16)

1. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix points. In Conf. Ree. 4th Symp. Principles of Prog. Lang. (POPL'77), pages 238 - 252. ACM, NY, 1977.
2. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, North-Holland, 1977.
3. J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:309-317, 1977.
4. G. A. Kildall. A unified approach to global program optimization. In Conf. Ree. 1st Symp. Principles of Prog. Lang. (POPL'73), pages 194 - 206. ACM, NY, 1973.
5. J. Knoop. Constant propagation in explicitly parallel programs. Technical report, Fak. f. Math. u. Inf., Univ. Passau, Germany, 1998.
6. J. Knoop. Eliminating partially dead code in explicitly parallel programs. TCS, 196(l-2):365-393, 1998. (Special issue devoted to Euro-Par'96).
7. J. Knoop, O. Rüthing, and B. Steffen. Partial dead code elimination. In Proc. ACM SIGPLAN Conf. on Prog. Lang. Design and Impl. (PLDI'94), volume 29,6 of ACM SIGPLAN Not., pages 147 - 158, 1994.
8. J. Knoop, B. Steffen, and J. Vollmer. Code motion for parallel programs. In Proc. of the Poster Session of the 6th Int. Conf. on Compiler Construction (GC'96), pages 81 - 88. TR LiTH-IDA-R-96-12, 1996.
9. J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. ACM Trans. Prog. Lang. Syst., 18(3):268-299, 1996.
10. S. P. Midkiff and D. A. Padua. Issues in the optimization of parallel programs. In Proc. Int. Conf. on Parallel Processing, Volume II, pages 105 - 113, 1990.
11. E. Morel and C. Renvoise. Global optimization by suppression of partial redundancies. Comm. ACM, 22(2):96-103, 1979.
12. J. H. Reif and R. Lewis. Symbolic evaluation and the global value graph. In Conf. Ree. 4th Symp. Principles of Prog. Lang. (POPL'77), pages 104 - 118. ACM, NY, 1977.
13. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In Conf. Ree. 15th Symp. Principles of Prog. Lang. (POPL'88), pages 2 - 27. ACM, NY, 1988.
14. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 7, pages 189 - 233. Prentice Hall, Englewood Cliffs, NJ, 1981.
15. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley, NY, 1996.
16. H. Zima and B. Chapman. Supercompilers for parallel and vector computers. Addison-Wesley, NY, 1991.