A novel probabilistic data flow framework

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

Volumn 2027, Issue , 2001, Pages 37-51

  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

DATA TRANSFER; PROGRAM COMPILERS;

BENCHMARK SUITES; DATA FLOW; EFFECTIVENESS AND EFFICIENCIES; EXECUTION HISTORY; PROBABILISTIC DATA; PROGRAM POINTS;

DATA FLOW ANALYSIS;

EID: 84958984858     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45306-7_4     Document Type: Conference Paper

References (19)

1. F. E. Allen and J. Cocke. A program data flow analysis procedure. Communications of the ACM, 19(3):137-147, March 1976.
2. 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.
3. R. Bodík, R. Gupta, and M.L. Soffa. Complete removal of redundant expressions. ACM SIGPLAN Notices, 33(5):1-14, May 1998.
4. A.L. Buchsbaum, H. Kaplan, A. Rogers, and J.R. Westbrook. Linear-time pointer- machine algorithms for LCAs, MST verification, and dominators. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 279-288, New York, May 23-26 1998. ACM Press.
5. B. Calder and D. Grunwald. Reducing branch costs via branch alignment. ACM SIGPLAN Notices, 29(11):242-251, November 1994.
6. J. A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput., C-30(7):478-490, 1981.
7. 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.
8. M.S. Hecht. Flow Analysis of Computer Programs. Programming Language Series. North-Holland, 1977.
9. E. Mehofer and B. Scholz. Probabilistic data flow system with two-edge profiling. Workshop on Dynamic and Adaptive Compilation and Optimization (Dynamo’00). ACM SIGPLAN Notices, 35(7):65-72, July 2000.
10. E. Mehofer and B. Scholz. Probabilistic procedure cloning for high-performance systems. In 12th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD’2000), Sao Pedro, Brazil, October 2000.
11. E. Mehofer and B. Scholz. Probabilistic communication optimizations and parallelization for distributed-memory systems. In PDP 2001, Mantova, Italy, February 2001.
12. T. C. Mowry and C.-K. Luk. Predicting data cache misses in non-numeric applica- tions through correlation profiling. In Proceedings of the 30th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-97), pages 314-320, Los Alamitos, December 1-3 1997. IEEE Computer Society.
13. 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.
14. 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.
15. B. G. Ryder and M. C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277-315, September 1986.
16. V. C. Sreedhar, G. R. Gao, and Y.-F. Lee. A new framework for elimination-based data flow analysis using DJ graphs. ACM Transactions on Programming Languages and Systems, 20(2):388-435, March 1998.
17. R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-614, July 1981.
18. C. Young and M. D. Smith. Better global scheduling using path profiles. In Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture (MICRO-98), pages 115-126, Los Alamitos, November 30-December 2 1998. IEEE Computer Society.
19. C. Young and M.D. Smith. Static correlated branch prediction. ACM Transactions on Programming Languages and Systems, 21(5):1028-1075, September 1999.