Gprof
Susan L. Graham, Peter B. Kessler, Marshall Kirk McKusick · 1982
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.
Cited by 971 works. doi:10.1145/800230.806987
Authors
References
- Depth-First Search and Linear Graph Algorithms
- An empirical study of FORTRAN programs
- UNIX programmer's manual
- Debugging tools for high level languages
- An execution profiler for modular programs
- An experiment in table driven code generation
- Writing efficient code
- An experiment in table driven code generation