Dataflow frequency analysis based on whole program paths

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn 2002-January, Issue , 2002, Pages 95-103

  Scholz, B ^a   Mehofer, E ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

Computer languages; Data analysis; Data flow computing; Feedback; Frequency; History; Information analysis; Instruments; Open loop systems; Optimizing compilers

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION; DATA TRANSFER; FEEDBACK; HISTORY; INFORMATION ANALYSIS; INSTRUMENTS; PARALLEL ARCHITECTURES; PROGRAM COMPILERS; STATIC ANALYSIS;

DATA FLOW COMPUTING; FREQUENCY; FREQUENCY ANALYSIS; HIGH PERFORMANCE COMPUTERS; MACHINE RESOURCES; OPEN LOOP SYSTEMS; OPTIMIZING COMPILERS; PROFILING INFORMATIONS;

DATA FLOW ANALYSIS;

EID: 34548036401     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2002.1106007     Document Type: Conference Paper

References (14)

1. T. Ball and J. Larus. Optimally profiling and tracing programs. ACM Transactions on Programming Languages and Systems, 16(4):1319-1360, July 1994.
2. T. Ball and J. Larus. Efficient path profiling. In Proc. of the IEEE/ACM International Symposium on Microarchitecture, pages 46-57, Paris, France, 1996.
3. S. Benkner, 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.
4. M. Hecht. Flow analysis of computer programs. Programming Language Series. North-Holland, 1977.
5. J. Larus. Whole program paths. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation (PLDI), pages 259-269, Atlanta, Georgia, May 1999.
6. 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.
7. E. Mehofer and B. Scholz. A novel probabilistic data flow framework. In International Conference on Compiler Construction (CC 2001), Lecture Notes in Computer Science (LNCS), Vol. 2027, pages 37-51, Genova, Italy, April 2001. Springer.
8. E. Mehofer and B. Scholz. Probabilistic communication optimizations and parallelization for distributed-memory systems. In Proc. of PDP 2001, pages 186-192, Mantova, Italy, February 2001.
9. D. Melski and T. Reps. Interprocedural path profiling. In International Conference on Compiler Construction (CC'99), Lecture Notes in Computer Science (LNCS), Vol. 1575, pages 47-62, Amsterdam, The Netherlands, March 1999. Springer.
10. C. G. Nevill-Manning and I. H. Witten. Compression and explanation using hierarchical grammars. The Computer Journal, 40(2/3), 1997.
11. 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.
12. 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.
13. Y. Zhang and R. Gupta. Timestamped whole program path representation and its applications. In Proc. of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 180-190, Snowbird, Utah, June 2001.
14. Y. Zhang and R. Gupta. Path matching in compressed control flow traces. In IEEE Data Compression Conference, pages 132-141, Snowbird, Utah, April 2002.