Fast Escape Analysis and Stack Allocation for Object-Based Programs (2000)
| Citations: | 32 - 0 self |
BibTeX
@INPROCEEDINGS{Gay00fastescape,
author = {David Gay and Bjarne Steensgaard},
title = {Fast Escape Analysis and Stack Allocation for Object-Based Programs},
booktitle = {},
year = {2000},
pages = {82--93},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the lifetime of a runtime stack frame. The analysis results can be used for many purposes, including stack allocation of objects, thread synchronization elimination, deadstore removal, code motion, and iterator reduction. A method to use the analysis results for transforming a program to allocate some objects on the runtime stack is also presented. For non-trivial programs, typically 10%-20% of all allocated objects are placed on the runtime stack after the transformation.
