Probabilistic data flow system with two-edge profiling

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 35, Issue 7, 2000, Pages 65-72

  Mehofer, Eduard ^a   Scholz, Bernhard ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1242336283     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/351403.351418     Document Type: Article

References (8)

1. G. Ammons and J.R. Larus. Improving data-flow analysis with path profiles. In Proc. of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI'98), pages 72-84, Montreal, Canada, June 1998.
2. Rastislav Bodik, Rajiv Gupta, and Mary Lou Soffa. Complete removal of redundant computations. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI-98), volume 33,5, pages 1-14, New York, June 17-19 1998. ACM Press.
3. R. Gupta, D. Berson, and J.Z. Fang. Path profile guided partial dead code elimination using predication. In International Conference on Parallel Architectures and Compilation Techniques (PACT'97), pages 102-115, San Francisco, California, November 1997.
4. R. Gupta, D. Berson, and J.Z. Fang. Path profile guided partial redundancy elimination using speculation. In IEEE International Conference on Computer Languages, pages 230-239, Chicago, Illinois, May 1998.
5. M.S. Hecht. Flow Analysis of Computer Programs. Programming Language Series. North-Holland, 1977.
6. Todd A. Proebsting and Charles N. Fischer. Probabilistic register allocation. In Proceedings of the 5th ACM SIGPLAN Conference on Programming Language Design and Implementation, 1992.
7. G. Ramalingam. Data flow frequency analysis. In Proc. of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation (PLDI'96), pages 267-277, Philadephia, Pennsylvania, May 1996.
8. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. of the ACM Symposium on Principles of Programming Languages (POPL '95), pages 49-61, San Francisco, CA, January 1995.