Edge profiling versus path profiling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Edge profiling versus path profiling: the showdown

Full text

Pdf (1.84 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

San Diego, California, United States

Pages: 134 - 148

Year of Publication: 1998

ISBN:0-89791-979-3

Authors

Thomas Ball	Bell Laboratories, Lucent Technologies
Peter Mataga	Bell Laboratories, Lucent Technologies
Mooly Sagiv	Dept. of Computer Science, Tel-Aviv University

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 20, Downloads (12 Months): 96, Citation Count: 23

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/268946.268958 What is a DOI?

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.

	ABD+97	Jennifer M. Anderson , Lance M. Berc , Jeffrey Dean , Sanjay Ghemawat , Monika R. Henzinger , Shun-Tak A. Leung , Richard L. Sites , Mark T. Vandevoorde , Carl A. Waldspurger , William E. Weihl, Continuous profiling: where have all the cycles gone?, Proceedings of the sixteenth ACM symposium on Operating systems principles, p.1-14, October 05-08, 1997, Saint Malo, France
	ABL97	Glenn Ammons , Thomas Ball , James R. Larus, Exploiting hardware performance counters with flow and context sensitive profiling, ACM SIGPLAN Notices, v.32 n.5, p.85-96, May 1997
	BL93	Thomas Ball , James R. Larus, Branch prediction for free, ACM SIGPLAN Notices, v.28 n.6, p.300-313, June 1993
	BL94	Thomas Ball , James R. Larus, Optimally profiling and tracing programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.4, p.1319-1360, July 1994 [doi>10.1145/183432.183527]
	BL96	Thomas Ball , James R. Larus, Efficient path profiling, Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture, p.46-57, December 02-04, 1996, Paris, France
	CMH91	Pohua P. Chang , Scott A. Mahlke , Wen-mei W. Hwu, Using profile information to assist classic code optimizations, Software—Practice & Experience, v.21 n.12, p.1301-1321, Dec. 1991 [doi>10.1002/spe.4380211204]
	CmWH88	P. P. Chang , W. W. Hwu, Trace selection for compiling large C application programs to microcode, Proceedings of the 21st annual workshop on Microprogramming and microarchitecture, p.21-29, November 28-December 02, 1988, San Diego, California, United States
	Dan63	G.B. Dantzig. Linear Programming and Bzt~,. sions. Princeton University Press, Princeton, N.J, 1963.
	EK72	Jack Edmonds , Richard M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM (JACM), v.19 n.2, p.248-264, April 1972 [doi>10.1145/321694.321699]
	FF92	Joseph A. Fisher , Stefan M. Freudenberger, Predicting conditional branch directions from previous runs of a program, ACM SIGPLAN Notices, v.27 n.9, p.85-95, Sept. 1992
	Fis81	J.A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Trans. acHons on Computers, C-39(7):478-490, July 1981.
	GJ79	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	GKM83	S.L. Graham, P. B. KesslerI and M. K. McKusick. An execution profiler for modular programs. SoflvJare-Practice and Experience, 13:671-685, 1983.
	KS73	D.E. Kau~h and F. R. Stevenson. Optimal measurement points for program frequency counts. BIT, I3:313-322, 1973.
	LS84	5. K. F. Lee and A. J. Smith. Branch prediction s~ra~egies and branch target buffer design. IEEE Computer, 17(1):6- 22, January 1984.
	PSR92	Shien-Tai Pan , Kimming So , Joseph T. Rahmeh, Improving the accuracy of dynamic branch prediction using branch correlation, ACM SIGPLAN Notices, v.27 n.9, p.76-84, Sept. 1992
	Smi81	James E. Smith, A study of branch prediction strategies, Proceedings of the 8th annual symposium on Computer Architecture, p.135-148, May 12-14, 1981, Minneapolis, Minnesota, United States
	Tar83	Robert Endre Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
	TW96	Claudia Tebaldi and Mike ~~est. Bayesian inference on network traffic using link count data. Technical report, Institute of Statistics and Decision Sciences Working Paper 16, Duke University, 1996.
	Wal91	David W. Wall, Predicting program behavior using real or estimated profiles, ACM SIGPLAN Notices, v.26 n.6, p.59-70, June 1991
	WMGH94	Tim A. Wagner , Vance Maverick , Susan L. Graham , Michael A. Harrison, Accurate static estimators for program optimization, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.85-96, June 20-24, 1994, Orlando, Florida, United States

CITED BY 23

	Sangwook P. Kim , Gary S. Tyson, Analyzing the working set characteristics of branch execution, Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture, p.49-58, November 1998, Dallas, Texas, United States
	Youtao Zhang , Rajiv Gupta, Timestamped whole program path representation and its applications, ACM SIGPLAN Notices, v.36 n.5, p.180-190, May 2001
	Rastislav Bodík , Rajiv Gupta , Mary Lou Soffa, Load-reuse analysis: design and evaluation, ACM SIGPLAN Notices, v.34 n.5, p.64-76, May 1999
	Mary Jean Harrold , Gregg Rothermel , Rui Wu , Liu Yi, An empirical investigation of program spectra, ACM SIGPLAN Notices, v.33 n.7, p.83-90, July 1998
	Evelyn Duesterwald , Vasanth Bala, Software profiling for hot path prediction: less is more, ACM SIGPLAN Notices, v.35 n.11, p.202-211, Nov. 2000
	James R. Larus, Whole program paths, ACM SIGPLAN Notices, v.34 n.5, p.259-269, May 1999
	Kameswari V. Garigipati , Cindy Norris, Evaluating the use of profiling by a region-based register allocator, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
	William C. Kreahling , Cindy Norris, Profile assisted register allocation, Proceedings of the 2000 ACM symposium on Applied computing, p.774-781, March 2000, Como, Italy
	Evelyn Duesterwald , Vasanth Bala, Software profiling for hot path prediction: less is more, ACM SIGOPS Operating Systems Review, v.34 n.5, p.202-211, Dec. 2000
	Thomas Kistler , Michael Franz, Continuous program optimization: A case study, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.4, p.500-548, July 2003
	Taweesup Apiwattanapong , Mary Jean Harrold, Selective path profiling, ACM SIGSOFT Software Engineering Notes, v.28 n.1, January 2003
	Qiong Cai , Jingling Xue, Optimal and efficient speculation-based partial redundancy elimination, Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, March 23-26, 2003, San Francisco, California
	Peng-Sheng Chen , Yuan-Shin Hwang , Roy Dz-Ching Ju , Jenq Kuen Lee, Interprocedural Probabilistic Pointer Analysis, IEEE Transactions on Parallel and Distributed Systems, v.15 n.10, p.893-907, October 2004
	Kavitha Srinivas , Harini Srinivasan, Summarizing application performance from a components perspective, ACM SIGSOFT Software Engineering Notes, v.30 n.5, September 2005
	Tipp Moseley , Alex Shye , Vijay Janapa Reddi , Matthew Iyer , Dan Fay , David Hodgdon , Joshua L. Kihm , Alex Settle , Dirk Grunwald , Daniel A. Connors, Dynamic run-time architecture techniques for enabling continuous optimization, Proceedings of the 2nd conference on Computing frontiers, May 04-06, 2005, Ischia, Italy
	Huihui Shi , Yi Wang , Haibing Guan , Alei Liang, An intermediate language level optimization framework for dynamic binary translation, ACM SIGPLAN Notices, v.42 n.5, p.3-9, May 2007
	Rahul Joshi , Michael D. Bond , Craig Zilles, Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems, Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, p.239, March 20-24, 2004, Palo Alto, California
	Sriraman Tallam , Xiangyu Zhang , Rajiv Gupta, Extending Path Profiling across Loop Backedges and Procedure Boundaries, Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization, p.251, March 20-24, 2004, Palo Alto, California
	Kapil Vaswani , Aditya V. Nori , Trishul M. Chilimbi, Preferential path profiling: compactly numbering interesting paths, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Michael D. Bond , Kathryn S. McKinley, Continuous Path and Edge Profiling, Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture, p.130-140, November 12-16, 2005, Barcelona, Spain
	Michael D. Bond , Kathryn S. McKinley, Practical Path Profiling for Dynamic Optimizers, Proceedings of the international symposium on Code generation and optimization, p.205-216, March 20-23, 2005
	Pierre Salverda , Charles Tu ker , Craig Zilles, Accurate critical path prediction via random trace construction, Proceedings of the sixth annual IEEE/ACM international symposium on Code generation and optimization, April 05-09, 2008, Boston, MA, USA
	Raymond P. L. Buse , Westley Weimer, The road not taken: Estimating path execution frequency statically, Proceedings of the 2009 IEEE 31st International Conference on Software Engineering, p.144-154, May 16-24, 2009