date and time created 82/03/11 21:13:18 by peter
[unix-history] / usr / src / usr.bin / gprof / PSD.doc / abstract.me
CommitLineData
bbc0d894
PK
1\" @(#)abstract.me 1.1 %G%
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
25Programs the size and complexity of compilers
26are composed of a large number of small routines,
27each implementing an abstraction for the routines
28that call it.
29To be useful, an execution profiler must attribute
30execution time in a way that is meaningful in terms of the
31logical structure of a program
32as well as its decomposition.
33The information must then be displayed to the user
34in a convenient and informative way.
35The \fBgprof\fP profiler described in this paper
36incorporates the running time of called routines
37in the running time of the routines that call them.
38The design and use of this profiler is described.