Call path refinement profiles
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 21 (6) , 481-496
- https://doi.org/10.1109/32.391375
Abstract
In order to effectively optimize complex programs built in a layered or recursive fashion (possibly from reused general components), the programmer has a critical need for performance information connected directly to the design decisions and other optimization opportunities present in the code. Call path refinement profiles are novel tools for guiding the optimization of such programs, that: 1) provide detailed performance information about arbitrarily nested (direct or indirect) function call sequences, and 2) focus the user驴s attention on performance bottlenecks by limiting and aggregating the information presented. This paper discusses the movitation for such profiles, describes in detail their implementation in the CPPROF profiler, and relates them to previous profilers, showing how most widely available profilers can be expressed simply and efficiently in terms of call path refinements.Keywords
This publication has 8 references indexed in Scilit:
- Tracing application program execution on the Cray X-MP and Cray 2Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Mtool: an integrated system for performance debugging shared memory multiprocessor applicationsIEEE Transactions on Parallel and Distributed Systems, 1993
- Call path profilingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Quartz: a tool for tuning parallel program performanceACM SIGMETRICS Performance Evaluation Review, 1990
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- GprofACM SIGPLAN Notices, 1982
- Program improvement by internal specializationPublished by Association for Computing Machinery (ACM) ,1981
- An empirical study of FORTRAN programsSoftware: Practice and Experience, 1971