• Cite Icon530
  • https://doi.org/10.1145/320384.320386Copy DOI Icon

Escape analysis for Java

  • Oct 1, 1999
  • Jong-Deok Choi +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread during its lifetime, so that synchronization operations on that object can be removed. We introduce a new program abstraction for escape analysis, the connection graph, that is used to establish reachability relationships between objects and object references. We show that the connection graph can be summarized for each method such that the same summary information may be used effectively in different calling contexts. We present an interprocedural algorithm that uses the above property to efficiently compute the connection graph and identify the non-escaping objects for methods and threads. The experimental results, from a prototype implementation of our framework in the IBM High Performance Compiler for Java, are very promising. The percentage of objects that may be allocated on the stack exceeds 70% of all dynamically created objects in three out of the ten benchmarks (with a median of 19%), 11% to 92% of all lock operations are eliminated in those ten programs (with a median of 51%), and the overall execution time reduction ranges from 2% to 23% (with a median of 7%) on a 333 MHz PowerPC workstation with 128 MB memory.

Similar Papers
  • Research Article
  • Citations45

Escape analysis for Java

  • Oct 01, 1999
  • ACM SIGPLAN Notices
  • Jong-Deok Choi +4
  • Research Article
  • Citations118

Stack allocation and synchronization optimizations for Java using escape analysis

  • Nov 01, 2003
  • ACM Transactions on Programming Languages and Systems
  • Jong-Deok Choi +4
  • Conference Article
  • Citations19

Practical escape analyses

  • Jun 13, 2007
  • Kyungwoo Lee +2
  • Conference Instance
  • Citations3

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

  • Oct 01, 1999
  • Research Article
  • Citations3

HEAT: a combined approach for thread escape analysis

  • Jun 01, 2011
  • International Journal of System Assurance Engineering and Management
  • Qichang Chen +2
  • Research Article
  • Citations15

Effective synchronization removal for Java

  • May 01, 2000
  • ACM SIGPLAN Notices
  • Erik Ruf
  • Conference Article
  • Citations199

Effective synchronization removal for Java

  • May 01, 2000
  • Erik Ruf
  • Research Article
  • Citations22

Fast and precise points-to analysis

  • May 06, 2009
  • Information and Software Technology
  • Jonas Lundberg +3
  • Research Article
  • Citations4

Sparse Graph Connectivity for Image Segmentation

  • Jun 16, 2020
  • ACM Transactions on Knowledge Discovery from Data
  • Xiaofeng Zhu +5
  • Conference Article
  • Citations5

Escape analysis for synchronization removal

  • Apr 23, 2006
  • Lei Wang +1
  • Book Chapter
  • Citations14

Efficiently Verifiable Escape Analysis

  • Jan 01, 2004
  • Matthew Q Beers +2
  • Book Chapter
  • Citations26

Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs

  • Jan 01, 2004
  • Venkatesh Prasad Ranganath +1
  • Conference Article

Thread escape analysis for Java programs based on Soot

  • Dec 01, 2009
  • Yongxian Jin +3
  • Conference Article
  • Citations7

Escape from escape analysis of Golang

  • Jun 27, 2020
  • Cong Wang +5
  • Conference Article
  • Citations7

Stack allocation of objects in the CACAO virtual machine

  • Aug 27, 2009
  • Peter Molnar +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.