Efficient Path Profiling

Efficient Path Profiling (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Thomas Ball , James R. Larus

Venue:	In Proceedings of the 29th Annual International Symposium on Microarchitecture
Citations:	231 - 8 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Efficient Path Profiling	SVM HeaderParse 0.2
AUTHOR NAME	Thomas Ball	SVM HeaderParse 0.2
AUTHOR AFFIL	Bell Laboratories Dept. of Computer Sciences; Lucent Technologies University of Wisconsin-Madison	SVM HeaderParse 0.2
AUTHOR NAME	James R. Larus	SVM HeaderParse 0.2
AUTHOR AFFIL	Bell Laboratories Dept. of Computer Sciences; Lucent Technologies University of Wisconsin-Madison	SVM HeaderParse 0.2
ABSTRACT	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.	SVM HeaderParse 0.2
YEAR	1996	INFERENCE
VENUE	In Proceedings of the 29th Annual International Symposium on Microarchitecture	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	46--57	INFERENCE
CITATIONS	11 found	ParsCit 1.0