gprof: a Call Graph Execution Profiler (1982)
| Citations: | 285 - 0 self |
BibTeX
@MISC{Graham82gprof:a,
author = {Susan L. Graham and Peter B. Kessler and Marshall K. McKusick},
title = {gprof: a Call Graph Execution Profiler},
year = {1982}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Large complex programs are composed of many small routines that implement abstractions for the routines that call them. To be useful, an execution profiler must attribute execution time in a way that is significant for the logical structure of a program as well as for its textual decomposition. This data must then be displayed to the user in a convenient and informative way. The gprof profiler accounts for the running time of called routines in the running time of the routines that call them. The design and use of this profiler is described. 1. Programs to be Profiled Software research environments normally include many large programs both for production use and for experimental investigation. These programs are typically modular, in accordance with generally accepted principles of good program design. Often they consist of numerous small routines that implement various abstractions. Sometimes such large programs are written by one programmer who has understood the requirements for t...
Citations
No citations identified.
