The Community for Technology Leaders
Green Image
Issue No. 06 - June (1995 vol. 21)
ISSN: 0098-5589
pp: 481-496
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 <tt>CPPROF</tt> 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.
Performance tuning, call path, profiling.

R. J. Hall, "Call Path Refinement Profiles," in IEEE Transactions on Software Engineering, vol. 21, no. , pp. 481-496, 1995.
82 ms
(Ver 3.3 (11022016))