1\" @(#)abstract.me 1.6 03/15/82 2.sp 1 3.ce 1000 4\fB\s+2gprof: a Call Graph Execution Profiler\s-2\fP\** 5.(f 6\**This work was supported by grant MCS80-05144 7from the National Science Foundation. 8.sp 2i 9.)f 10.sp 1 11by 12\fISusan L. Graham\fP 13\fIPeter B. Kessler\fP 14\fIMarshall K. McKusick\fP 15.sp 1 16Computer Science Division 17Electrical Engineering and Computer Science Department 18University of California, Berkeley 19Berkeley, California 94720 20.ce 0 21.sp 1 22.sp 0.5i 23.sh 0 "Abstract" 24.pp 25Large complex programs are composed of many small routines 26that implement abstractions for the routines that call them. 27To be useful, an execution profiler must attribute 28execution time in a way that is significant for the 29logical structure of a program 30as well as for its textual decomposition. 31This data must then be displayed to the user 32in a convenient and informative way. 33The \fBgprof\fP profiler 34accounts for the running time of called routines 35in the running time of the routines that call them. 36The design and use of this profiler is described. 37