Interprocedural compatibility analysis for static object preallocation

Authors:
Ovidiu Gheorghioiu;Alexandru Salcianu;Martin Rinard
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
2003

Citing 16
Cited 13

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Software caching and computation migration in Olden

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modern compiler implementation in Java

Modern compiler implementation in Java
A region inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Escape analysis for Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Escape analysis for object-oriented languages: application to Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Removing unnecessary synchronization in Java

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Compositional pointer and escape analysis for Java programs

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
New methods to color the vertices of a graph

Communications of the ACM
Region-based memory management in cyclone

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
The Real-Time Specification for Java

The Real-Time Specification for Java
Data Flow Analysis for Software Prefetching Linked Data Structures in Java

Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques
The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism

ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming

Ownership types for safe region-based memory management in real-time Java

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Object equality profiling

OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs

Proceedings of the 4th international symposium on Memory management
Object-Distribution Analysis for Program Decomposition and Re-Clustering

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
Static insertion of safe and effective memory reuse commands into ML-like programs

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Free-Me: a static analysis for automatic individual object reclamation

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Detecting and eliminating memory leaks using cyclic memory allocation

Proceedings of the 6th international symposium on Memory management
Inserting safe memory reuse commands into ML-like programs

SAS'03 Proceedings of the 10th international conference on Static analysis
Just-in-time compiler assisted object reclamation and space reuse

NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Static detection of loop-invariant data structures

ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
Finding reusable data structures

Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs

Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
LeakChecker: Practical Static Memory Leak Detection for Managed Languages

Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

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.