1\" @(#)abstract.me 1.3 03/12/82 2.ls 1 3.lp 4.sp 1 5.ce 1000 6\fB\s+2gprof: a Call Graph Execution Profiler\s-2\fP\** 7.(f 8\**This work was supported by grant MCS80-05144 9from the National Science Foundation. 10.)f 11.sp 1 12by 13\fISusan L. Graham\fP 14\fIPeter B. Kessler\fP 15\fIMarshall K. McKusick\fP 16.sp 1 17Computer Science Division 18Electrical Engineering and Computer Science Department 19University of California, Berkeley 20Berkeley, California 94720 21.ce 0 22.sp 1 23.sh 0 "Abstract" 24.pp 25Large complex programs are composed of a number of 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 meaningful in terms of the 29logical structure of a program 30as well as in terms of 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