ThesaHelp: ACM references f-l
Topic: execution profile
| |
Reference
Graham, S.L., Kessler, P.B., McKusick, M.K.,
"gprof: a call graph execution profiler",
Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction, Boston, Massachusetts, USA, June 1982,
SIGPLAN Notices, 17, 6, pp. 120-126.
Google
Other Reference
reprinted, p. 49-57 in 20 Years of the ACM/SIGPLAN Conference of Programming Language Design and Implementation (1979-1999): A selection, ACM SIGPLAN 39.4, April 2004.
Quotations
retrospective ;;Quote: gprof combines call graph arcs with program histogram data for elapsed time, call counts, and time per subroutine
| retrospective ;;Quote: gprof has problems with skewed times and mutual recursion; fix by gathering complete call stacks; requires walking the stack
| 52 ;;Quote: gprof uses call site as primary hash key and callee address as secondary key; 5-30% overhead; no planning required
| 53 ;;Quote: problem of profiling under time-sharing; gprof samples the program counter to infer execution time
|
Related Topics
ThesaHelp: ACM references f-l (241 items)
Topic: execution profile (43 items)
|