Article

Compiler-directed run-time monitoring of program data access

Authors:

Yutao ZhongAuthors Info & Claims

MSP '02: Proceedings of the 2002 workshop on Memory system performance

Pages 1 - 12

https://doi.org/10.1145/773146.773040

Published: 16 June 2002 Publication History

Abstract

Accurate run-time analysis has been expensive for complex programs, in part because most methods perform on all a data. Some applications require only partial reorganization. An example of this is off-loading infrequently used data from a mobile device. Complete monitoring is not necessary because not all accesses can reach the displaced data. To support partial monitoring, this paper presents a framework that includes a source-to-source C compiler and a run-time monitor. The compiler inserts run-time calls, which invoke the monitor during execution. To be selective, the compiler needs to identify relevant data and their access. It needs to analyze both the content and the location of monitored data. To reduce run-time overhead, the system uses a source-level interface, where the compiler transfers additional program information to reduce the workload of the monitor. The paper describes an implementation for general C programs. It evaluates different levels of data monitoring and their application on an SGI workstation and an Intel PC.

References

[1]

A. V. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, second edition, 1986.

Digital Library

[2]

M. Arnold and B. G. Ryder. A framework for reducing the cost of instrumented code. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, Utah, 2001.

Digital Library

[3]

T. M. Austin, S. E. Breach, and G. S. Sohi. Efficient detection of all pointer and array access errors. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, Orlando, Florida, 1994.

Digital Library

[4]

H. J. Boehm. Space efficient conservative garbage collection. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, NM, June 1993.

Digital Library

[5]

D. Callahan, K. Kennedy, and A. Porterfield. Analyzing and visualizing performance of memory hierarchies. In Performance Instrumentation and Visualization, pages 1--26. ACM Press, 1990.

Digital Library

[6]

D. K. Chen, H. H. Su, and P. C. Yew. The impact of synchronization and granularity in parallel systems. In Proceedings of the 17th Annual International Symposium on Computer Architecture, 1990.

Digital Library

[7]

J. Cocke. Global common subexpression elimination. ACM SIGPLAN Notices, 5(7):20--24, 1970.

Digital Library

[8]

C. Ding and K. Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the SIGPLAN '99 Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.

Digital Library

[9]

A. Diwan, K. McKinley, and E. Moss. Type-based alias analysis. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, 1998.

Digital Library

[10]

C. Fraser and D. Hanson. A retargetable C compiler: design and implementation. Benjamin/Cummings, 1995.

Digital Library

[11]

R. Hastings and B. Joyce. Purify: fast detection of memory leaks and access errors. In Proceedings of the Winter Usenix Conference, 1992.

[12]

Paul Havlak. Interprocedural Symbolic Analysis. PhD thesis, Dept. of Computer Science, Rice University, May 1994. Also available as CRPC-TR94451 from the Center for Research on Parallel Computation and CS-TR94--228 from the Rice Department of Computer Science.

Digital Library

[13]

M. Hirzel and T. M. Chilimbi. Bursty tracing: A framework for low-overhead temporal profiling. In Proceedings of ACM Workshop on Feedback-Directed and Dynamic Optimization, Dallas, Texas, 2001.

[14]

J. R. Larus. Abstract execution: A technique for efficiently tracing programs. Software-Practice and Experience (SPE), 20(12), 1990.

Digital Library

[15]

J. Mellor-Crummey, R. Fowler, and D. B. Whalley. Tools for application-oriented performance tuning. In Proceedings of the 15th ACM International Conference on Supercomputing, Sorrento, Italy, 2001.

Digital Library

[16]

J. L. Steffen. Adding run-time checking to the portable C compiler. Software Practice and Experience, 22(4), 1992.

Digital Library

[17]

R. A. Sugumar and S. G. Abraham. Multi-configuration simulation algorithms for the evaluation of computer architecture designs. Technical report, University of Michigan, 1993.

[18]

L. Xiao, X. Zhang, and S. A. Kubricht. Improving memory performance of sorting algorithms. ACM Journal on Experimental Algorithmics, 5:1--23, 2000.

Digital Library

[19]

Y. Zhong, C. Ding, and K. Kennedy. Reuse distance analysis for scientific programs. In Proceedings of Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers, Washington DC, March 2002.

Cited By

Zhong YShen XDing C(2009)Program locality analysis using reuse distanceACM Transactions on Programming Languages and Systems10.1145/1552309.155231031:6(1-39)Online publication date: 26-Aug-2009
https://dl.acm.org/doi/10.1145/1552309.1552310
Rafkind JWick ARegehr JFlatt MKolodner HSteele G(2009)Precise garbage collection for CProceedings of the 2009 international symposium on Memory management10.1145/1542431.1542438(39-48)Online publication date: 19-Jun-2009
https://dl.acm.org/doi/10.1145/1542431.1542438
Zhong YChang WJones RBlackburn S(2008)Sampling-based program locality approximationProceedings of the 7th international symposium on Memory management10.1145/1375634.1375648(91-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375634.1375648
Show More Cited By

Compiler-directed run-time monitoring of program data access
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Compiler-directed run-time monitoring of program data access
MSP 2002 and ISMM 2002

Accurate run-time analysis has been expensive for complex programs, in part because most methods perform on all a data. Some applications require only partial reorganization. An example of this is off-loading infrequently used data from a mobile device. ...
Theory and art of semantics-directed program execution monitoring
A framework for monitoring program execution

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MSP '02: Proceedings of the 2002 workshop on Memory system performance

June 2002

298 pages

ISBN:9781450373685

DOI:10.1145/773146

Conference Chairs:
Frank Mueller
NC State University
,
Trishul Chilimbi
Microsoft Research
,
Chen Ding
University of Rochester

ACM SIGPLAN Notices Volume 38, Issue 2 supplement
MSP 2002 and ISMM 2002
February 2003
291 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/773039
Issue’s Table of Contents

Copyright © 2002 Copyright is held by the owner/author(s).

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 June 2002

Check for updates

Qualifiers

Article

Conference

MSP02

Sponsor:

SIGPLAN

MSP02: Workshop on Memory System Performance ( co-located with PLDI 2002 )

June 16, 2002

Berlin, Germany

Acceptance Rates

Overall Acceptance Rate 6 of 20 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
489
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhong YShen XDing C(2009)Program locality analysis using reuse distanceACM Transactions on Programming Languages and Systems10.1145/1552309.155231031:6(1-39)Online publication date: 26-Aug-2009
https://dl.acm.org/doi/10.1145/1552309.1552310
Rafkind JWick ARegehr JFlatt MKolodner HSteele G(2009)Precise garbage collection for CProceedings of the 2009 international symposium on Memory management10.1145/1542431.1542438(39-48)Online publication date: 19-Jun-2009
https://dl.acm.org/doi/10.1145/1542431.1542438
Zhong YChang WJones RBlackburn S(2008)Sampling-based program locality approximationProceedings of the 7th international symposium on Memory management10.1145/1375634.1375648(91-100)Online publication date: 7-Jun-2008
https://dl.acm.org/doi/10.1145/1375634.1375648
Schulz MWhite BMcKee SLee HJeitner JBagherzadeh NValero MRamirez A(2005)OwlProceedings of the 2nd conference on Computing frontiers10.1145/1062261.1062284(116-124)Online publication date: 4-May-2005
https://dl.acm.org/doi/10.1145/1062261.1062284
Zhong YOrlovich MShen XDing C(2004)Array regrouping and structure splitting using whole-program reference affinityACM SIGPLAN Notices10.1145/996893.99687239:6(255-266)Online publication date: 9-Jun-2004
https://dl.acm.org/doi/10.1145/996893.996872
Zhong YOrlovich MShen XDing CPugh WChambers C(2004)Array regrouping and structure splitting using whole-program reference affinityProceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation10.1145/996841.996872(255-266)Online publication date: 9-Jun-2004
https://dl.acm.org/doi/10.1145/996841.996872
Ding COrlovich MHuskamp J(2004)The Potential of Computation Regrouping for Improving LocalityProceedings of the 2004 ACM/IEEE conference on Supercomputing10.1109/SC.2004.58Online publication date: 6-Nov-2004
https://dl.acm.org/doi/10.1109/SC.2004.58
Ding CZhong YCytron RGupta R(2003)Predicting whole-program locality through reuse distance analysisProceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation10.1145/781131.781159(245-257)Online publication date: 9-Jun-2003
https://dl.acm.org/doi/10.1145/781131.781159
Ding CZhong Y(2003)Predicting whole-program locality through reuse distance analysisACM SIGPLAN Notices10.1145/780822.78115938:5(245-257)Online publication date: 9-May-2003
https://dl.acm.org/doi/10.1145/780822.781159
Banerjee SDevecsery DChen PNarayanasamy S(2020)Sound garbage collection for C using pointer provenanceProceedings of the ACM on Programming Languages10.1145/34282444:OOPSLA(1-28)Online publication date: 13-Nov-2020
https://dl.acm.org/doi/10.1145/3428244
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten