Optimally Profiling and Tracing Programs (1992)
Cached
Download Links
- [research.microsoft.com]
- [www.eecs.harvard.edu]
- [ftp.cs.wisc.edu]
- [www.ecst.csuchico.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Programming Languages and Systems |
| Citations: | 255 - 17 self |
BibTeX
@INPROCEEDINGS{Ball92optimallyprofiling,
author = {Thomas Ball and Thomas Ball and James R. Larus and James R. Larus},
title = {Optimally Profiling and Tracing Programs},
booktitle = {ACM Transactions on Programming Languages and Systems},
year = {1992},
pages = {59--70}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs with respect to the commonly-used technique of placing code in each basic block. Program profiling counts the number of times each basic block in a program executes. Instruction tracing records the sequence of basic blocks traversed in a program execution. The algorithms optimize the placement of counting/tracing code with respect to the expected or measured frequency of each block or edge in a program's control-flow graph. We have implemented the algorithms in a profiling/tracing tool and they substantially reduce the overhead of profiling and tracing.
