ACM Home Page
Please provide us with feedback. Feedback
Gprof: A call graph execution profiler
Full text PdfPdf (685 KB)
Source Symposium on Compiler Construction archive
Proceedings of the 1982 SIGPLAN symposium on Compiler construction table of contents
Boston, Massachusetts, United States
Pages: 120 - 126  
Year of Publication: 1982
ISBN:0-89791-074-5
Also published in ...
Authors
Susan L. Graham  Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California
Peter B. Kessler  Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California
Marshall K. Mckusick  Computer Science Division, Electrical Engineering and Computer Science Department, University of California, Berkeley, Berkeley, California
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 88,   Citation Count: 136
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800230.806987
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bentley, J. L., "Writing Efficient Code", Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania, CMU-CS-81-116, 1981.
2
 
3
Joy, W. N., Graham, S. L., Haley, C. B. "Berkeley Pascal User's Manual", Version 1.1, Computer Science Division University of California, Berkeley, CA. April 1979.
 
4
Knuth, D. E. "An empirical study of FORTRAN programs", Software - Practice and Experience, 1, 105-133. 1971
 
5
Satterthwaite, E. "Debugging Tools for High Level Languages", Software - Practice and Experience, 2, 197-217, 1972
 
6
Tarjan, R. E., "Depth first search and linear graph algorithm," SIAM J. Computing1:2, 146-160, 1972.
 
7
Unix Programmer's Manual, prof command", section 1, Bell Laboratories, Murray Hill, NJ. January 1979.

CITED BY  136
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Susan L. Graham: colleagues
Peter B. Kessler: colleagues
Marshall K. Mckusick: colleagues

Peer to Peer - Readers of this Article have also read: