Preferential path profiling: Compactly numbering interesting paths

ACM SIGPLAN Notices

Volumn 42, Issue 1, 2007, Pages 351-362

  Vaswani, Kapil ^a   Nori, Aditya V ^b   Chilimbi, Trishul M ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Arithmetic coding; Dynamic analysis; Preferential paths; Profiling

Indexed keywords

ARITHMETIC CODING; DYNAMIC ANALYSIS; PREFERENTIAL PATHS; PROFILING;

ALGORITHMS; COMPUTER APPLICATIONS; INFORMATION ANALYSIS; NUMBER THEORY;

COMPUTER PROGRAMMING;

EID: 33846522392     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (15)

1. G. Ammons and J. R. Larus. Improving data-flow analysis with path profiles. In ACM SICPLAN Symposium on Programming Language Design and Implementation (PLDI), pages 72-84, 1998.
2. T. Apiwattanapong and M. J. Harrold. Selective path profiling. In Workshop, on Program Analysis for Software Tools and Engineering (PASTE), pages 35-42, 2002.
3. T. Ball and J. R. Larus. Efficient path profiling. In International Symposium on Microarchitecture (MICRO), pages 46-57, 1996.
4. T. Ball and J. R. Larus. Programs follow paths. Technical Report MSR-TR-99-01, Microsoft Research, 1999.
5. T. Ball, P. Mataga, and S. Sagiv. Edge profiling versus path profiling: The showdown. In ACM SIGPLAN Symposium on Principles of Programming Languages(POPL), pages 134-148, 1998.
6. M. D. Bond and K. S. McKinley. Practical path profiling for dynamic optimizers. In International Symposium on Code Generation and Optimization (CGO), pages 205-216, 2005.
7. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., N. Y., 1991.
8. R. Joshi, M. D. Bond, and C. B. Zilles. Targeted path profiling: Lower overhead path profiling for staged dynamic optimization systems. In International Symposium on Code Generation and Optimization (CGO), pages 239-250, 2004.
9. A. Kolmogorov. Three approaches to the quantitative definition of information. Prob. Peredach Inform, 1(1):3-11, 1965.
10. K. S. McKinley, J. Burrill, M. D. Bond, D. Burger, B. Cahoon, J. Gibson, J. E. B. Moss, A. Smith, Z.Wang, and C. Weems. The Scale compiler. http://ali-www.cs.umass.edu/Scale, 2005.
11. D. Melski and T. W. Reps. Interprocedural path profiling. In Proceedings of the 8th International Conference on Compiler Construction (CC), pages 47-62, 1999.
12. E. Perelman, T. M. Chilimbi, and B. Calder. Variational path profiling. In Parallel Architectures and Compilation Techniques '05 (PACT), pages 7-16, 2005.
13. J. Rissanen and G. G. Langdon. Arithmetic coding. IBM J. Res. Develop., 23(2): 149-162, 1979.
14. S. Tallam, X. Zhang, and R. Gupta. Extending path profiling across loop backedges and procedure boundaries. In International Symposium on Code Generation and Optimization (CGO), pages 251-264, 2004.
15. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, 1987.