Incremental call-path profiling

Concurrency and Computation: Practice and Experience

Volumn 19, Issue 11, 2007, Pages 1533-1547

  Bernat, Andrew R ^a   Miller, Barton P ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Dynamic instrumentation; Performance analysis; Profiling

Indexed keywords

DATA STRUCTURES; FUNCTION EVALUATION; LINEAR ALGEBRA; OPTIMIZATION; SET THEORY;

COMPLEX METRICS; DYNAMIC INSTRUMENTATION; PERFORMANCE ANALYSIS;

PARALLEL PROGRAMMING;

EID: 34547641251     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1125     Document Type: Conference Paper

References (17)

1. Ammons G, Ball T, Larus JR. Exploiting hardware performance counters with flow and context sensitive profiling. Proceedings of the SIGPLAN'97 Conference on Programming Language Design and Implementation (PLDI), Las Vegas, NV, June 1997. ACM Press: New York, 1997; 85-96.
2. Ball T, Larus JR. Efficient path profiling. Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, Paris, December 1996. ACM Press: New York, 1996; 46-57.
3. DeRose L, Wolf F. CATCH: A call-graph based automatic tool for capture of hardware performance metrics for MPI and OpenMP applications. Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002. Springer: Berlin, 2002.
4. Larus JR. Whole program paths. Proceedings of the SIGPLAN'99 Conference on Programming Languages Design and Implementation, Atlanta, GA, May 1999. ACM Press: New York, 1999.
5. Malony AD, Shende S, Bell R, Li K, Li L, Trebon N. Advances in the TAU performance system. Performance Analysis and Distributed Computing. Kluwer: Norwell, MA, 2003.
6. Melski D, Reps T. Interprocedural path profiling. Proceedings of the 8th International Conference on Compiler Construction (CC'99), Amsterdam, March 1999. Springer: Berlin, 1999.
7. Melski D. Interprocedural path profiling and the interprocedural express-lane transformation. PhD Dissertation, University of Wisconsin, Madison, WI, 2002.
8. Graham S, Kessler P, McKusick M. gprof: A call graph execution profiler. Proceedings of the SIGPLAN Symposium on Compiler Construction, Boston, MA, June 1982. ACM Press: New York, 1982; 120-126.
9. Hall RJ. Call path refinement profiles. IEEE Transactions on Software Engineering 1995; 21(6):481-496.
10. SPROF, GNU shared object profiling utility, http://www.gnu.org/software/ libc [6 October 2006].
11. Bernard C, Ogilvie MC, DeGrand TA, DeTar C, Gottlieb S, Kransitz A, Siugar RL, Toussaint D. Studying quarks and gluons on MIMD parallel computers. International Journal of Supercomputer Applications 1991; 5:61-70.
12. Miller BP, Callaghan MD, Cargille JM, Hollingsworth JK, Irvin RB, Karavanic KL, Kunchithapadam K, Newhall T. The Paradyn parallel performance measurement tools. IEEE Computer 1995; 28(11):37-46.
13. Buck B, Hollingsworth JK. An API for runtime code patching. The International Journal of High Performance Computing Applications 2000; 14(4):317-329.
14. Spivey JM. Fast, accurate call graph profiling. Software - Practice and Experience 2004; 34(3):249-264.
15. PAPI home page, http://icl.cs.utk.edu/papi/ [8 September 2006].
16. PMAPI home page, http://www.alphaworks.ibm.com/tech/pmapi [8 September 2006].
17. Gottlieb S, Liu W, Toussaint D, Renken RL, Sugar RL. Hybrid-molecular- dynamics algorithms for the numerical simulation of quantum chromodynamics. Physical Review D 1987; 35:2531-2542.