• DOI:10.1109/MICRO.1996.566449
• Corpus ID: 1907075

Efficient path profiling

@article{Ball1996EfficientPP,
  title={Efficient path profiling},
  author={Thomas Ball and James R. Larus},
  journal={Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29},
  year={1996},
  pages={46-57}
}

• T. Ball, J. Larus
• Published 2 December 1996
• Computer Science
• Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29

A path profile determines how many times each acyclic path in a routine executes. This type of profiling subsumes the more common basic block and edge profiling, which only approximate path frequencies. Path profiles have many potential uses in program performance tuning, profile-directed compilation, and software test coverage. This paper describes a new algorithm for path profiling. This simple, fast algorithm selects and places profile instrumentation to minimize run-time overhead. Instrumented programs run with overhead comparable to the best previous profiling techniques. On the SPEC95 benchmarks, path profiling overhead averaged 31%, as compared to 16% for efficient edge profiling. Path profiling also identifies longer paths than a previous technique, which predicted paths from edge profiles (average of 88, versus 34 instructions). Moreover, profiling shows that the SPEC95 train input datasets covered most of the paths executed in the ref datasets.