article

Interprocedural compatibility analysis for static object preallocation

Authors:

Ovidiu Gheorghioiu,

Alexandru Salcianu,

Martin RinardAuthors Info & Claims

ACM SIGPLAN Notices, Volume 38, Issue 1

Pages 273 - 284

https://doi.org/10.1145/640128.604154

Published: 15 January 2003 Publication History

Abstract

We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at the same time as any object allocated at the other site. If an allocation site is compatible with itself, it is said to be unitary: at most one object allocated at that site is live at any given point in the, execution of the program. We use the results of the analysis to statically preallocate memory space for the objects allocated at unitary sites, thus simplifying the computation of an upper bound on the amount of memory required to execute the program. We also use the analysis to enable objects allocated at several compatible allocation sites to share the same preallocated memory. Our experimental results show that, for our set of Java benchmark programs, 60% of the allocation sites are unitary and can be statically preallocated. Moreover, allowing compatible unitary allocation sites to share the same preallocated memory leads to a 95% reduction in the amount of memory preallocated for these sites.

References

[1]

Ole Agesen. The cartesian product algorithm. In Proceedings of the 9th European Conference on Object-Oriented Programming Lecture Notes in Computer Science, 1995.

Digital Library

[2]

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

Digital Library

[3]

C. Scott Ananian. MIT FLEX compiler infrastructure for Java. http://www.flex-compiler.lcs.mit.edu.

[4]

C. Scott Ananian. Static single information form. Master's thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, September 1999.

[5]

Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language PhD thesis, DIKU, University of Copenhagen, May 1994.

[6]

Andrew Appel. Modern Compiler Implementation in Java Cambridge University Press, 1998.

Digital Library

[7]

B. Blanchet. Escape analysis for object oriented languages. Application to Java. In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications Denver, CO, November 1999.

Digital Library

[8]

J. Bogda and U. Hoelzle. Removing unnecessary synchronization in Java. In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications Denver, CO, November 1999.

Digital Library

[9]

Gregory Bollella, James Gosling, Benjamin Brosgol, Peter Dibble, Steve Furr, and Mark Turnbull. The Real-Time Specification for Java Addison-Wesley, Reading, Mass., 2000.

Digital Library

[10]

Daniel Brélaz. New methods to color the vertices of a graph. Communications of the ACM (22): 251--256, 1979.

Digital Library

[11]

Brendon Cahoon and Kathryn S. McKinley. Data flow analysis for software prefetching linked data structures in Java. In Proceedings of the 10th International Conference on Parallel Architectures and Compilation Techniques 2001.

Digital Library

[12]

Martin C. Carlisle and Anne Rogers. Software caching and computation migration in Olden. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming 1995.

Digital Library

[13]

David R. Chase, Mark Wegman, and F. Kenneth Zadeck. Analysis of pointers and structures. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation 1990.

Digital Library

[14]

J. Choi, M. Gupta, M. Serrano, V. Sreedhar, and S. Midkiff. Escape analysis for Java. In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications Denver, CO, November 1999.

Digital Library

[15]

R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13(4): 451--490, October 1991.

Digital Library

[16]

Ovidiu Gheorghioiu. Statically determining memory consumption of real-time Java threads. MEng thesis, Massachusetts Institute of Technology, 2002.

[17]

Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling Wang, and James Cheney. Region-based memory management in Cyclone. In Proceedings of the SIGPLAN '02 Conference on Programming Language Design and Implementation 2002.

Digital Library

[18]

Bjarne Steensgaard. Points-to analysis in almost linear time. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages St. Petersburg Beach, FL, January 1996.

Digital Library

[19]

M. Tofte and L. Birkedal. A region inference algorithm. ACM Transactions on Programming Languages and Systems 20(4), July 1998.

Digital Library

[20]

J. Whaley and M. Rinard. Compositional pointer and escape analysis for Java programs. In Proceedings of the 14th Annual Conference on Object-Oriented Programming Systems, Languages and Applications Denver, CO, November 1999.

Digital Library

Cited By

Xu G(2012)Finding reusable data structuresACM SIGPLAN Notices10.1145/2398857.238469047:10(1017-1034)Online publication date: 15-Nov-2012
https://doi.org/10.1145/2398857.2384690
Xu GYan DRountev A(2012)Static detection of loop-invariant data structuresProceedings of the 26th European conference on Object-Oriented Programming10.1007/978-3-642-31057-7_32(738-763)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31057-7_32
Lee OYang HYi K(2005)Static insertion of safe and effective memory reuse commands into ML-like programsScience of Computer Programming10.1016/j.scico.2005.02.00758:1-2(141-178)Online publication date: Oct-2005
https://doi.org/10.1016/j.scico.2005.02.007
Show More Cited By

Index Terms

Interprocedural compatibility analysis for static object preallocation
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Garbage collection

Recommendations

Interprocedural compatibility analysis for static object preallocation
POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at the same time as any object allocated at the other site. If an allocation ...
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Interprocedural Pointer Analysis in Goanna

Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs. Unlike existing approaches, Goanna uses the off-the-shelf model checker NuSMV as its core analysis engine on a syntactic flow-...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 38, Issue 1

January 2003

298 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/640128

Issue’s Table of Contents

POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2003
308 pages
ISBN:1581136285
DOI:10.1145/604131
General Chair:
Alex Aiken
University of California, Berkeley, CA
,
Program Chair:
Greg Morrisett
Cornell University

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2003

Published in SIGPLAN Volume 38, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
429
Total Downloads

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

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Xu G(2012)Finding reusable data structuresACM SIGPLAN Notices10.1145/2398857.238469047:10(1017-1034)Online publication date: 15-Nov-2012
https://doi.org/10.1145/2398857.2384690
Xu GYan DRountev A(2012)Static detection of loop-invariant data structuresProceedings of the 26th European conference on Object-Oriented Programming10.1007/978-3-642-31057-7_32(738-763)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-31057-7_32
Lee OYang HYi K(2005)Static insertion of safe and effective memory reuse commands into ML-like programsScience of Computer Programming10.1016/j.scico.2005.02.00758:1-2(141-178)Online publication date: Oct-2005
https://doi.org/10.1016/j.scico.2005.02.007
Lee OYang HYi K(2003)Inserting Safe Memory Reuse Commands into ML-Like ProgramsStatic Analysis10.1007/3-540-44898-5_10(171-188)Online publication date: 13-May-2003
https://doi.org/10.1007/3-540-44898-5_10
Zhou DWang FYe HMa LPu SZhan D(2022)Forward Compatible Few-Shot Class-Incremental Learning2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)10.1109/CVPR52688.2022.00884(9036-9046)Online publication date: Jun-2022
https://doi.org/10.1109/CVPR52688.2022.00884
Yan DXu GYang SRountev A(2014)LeakCheckerProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2581122.2544151(87-97)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2581122.2544151
Yan DXu GYang SRountev A(2014)LeakCheckerProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2544137.2544151(87-97)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2544137.2544151
Xu G(2013)ResurrectorACM SIGPLAN Notices10.1145/2544173.250951248:10(111-130)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2544173.2509512
Xu GHosking AEugster PLopes C(2013)ResurrectorProceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications10.1145/2509136.2509512(111-130)Online publication date: 29-Oct-2013
https://dl.acm.org/doi/10.1145/2509136.2509512
Xu G(2012)Finding reusable data structuresACM SIGPLAN Notices10.1145/2398857.238469047:10(1017-1034)Online publication date: 19-Oct-2012
https://dl.acm.org/doi/10.1145/2398857.2384690
Show More Cited By

View Options

Get Access

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.

Media

Figures

Other

Tables

View Issue’s Table of Contents