Gprof: A call graph execution profiler

  • Authors:
  • Susan L. Graham;Peter B. Kessler;Marshall K. Mckusick

  • Affiliations:
  • Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California;Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California;Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California

  • Venue:
  • SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

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.