Whole program path profiling

作者: James R. Larus , Christopher W. Fraser

DOI:

关键词:

摘要: A program is instrumented to record acyclic paths during execution of the program. whole path produced from and provides a complete compact program's entire control flow. It includes crossing loop boundaries procedure provide picture dynamic behavior. string compression algorithm that constructs context-free grammar used compress trace uncover its regular structure. Heavily executed subpaths are easily identified representation by traversing find hot according input parameters minimum maximum lengths cost.

参考文章(30)
Thomas Reps, David Binkley, Susan Horwitz, Interprocedural slicing of computer programs using dependence graphs ,(1989)
C.G. Nevill-Manning, I.H. Witten, Linear-time, incremental hierarchy inference for compression data compression conference. pp. 3- 11 ,(1997) , 10.1109/DCC.1997.581951
David Melski, Thomas Reps, Interprocedural Path Profiling compiler construction. pp. 47- 62 ,(1999) , 10.1007/978-3-540-49051-7_4
Vita Bortnikov, Mark Novick, Bilha Mendelson, William Jon Schmidt, Inbal Shavit-Lottem, Method and apparatus for profile-based reordering of program portions in a computer program ,(1997)
Robert A. Eustace, Carl A. Waldspurger, Jeffrey Dean, James E. Hicks, William E. Weihl, Method for estimating execution rates of program execution paths ,(1997)