article · 2008

Abstract Optimistic Stack Allocation For Java-Like Languages

Cited by 0Abstract and details only

Abstract

Stack allocation of objects offers more efficient use of cache memories on modern computers, but finding objects that can be safely stack allocated is difficult, as interprocedural escape analysis is imprecise in the presence of virtual method dispatch and dynamic class loading. We present a new technique for doing optimistic stack allocation of objects. Our technique does not require interprocedural analysis and is effective in the presence of dynamic class loading, reflection and exception handling. Moreover, we usually achieve higher proportions of stack allocated data than static strategies. In this paper we present optimistic stack-allocation for Java-like languages. For experiments we use traces of running Java programs to drive simulations of various garbage collection and allocation strategies.

Cite this paper

APA 7

(2008). Abstract Optimistic Stack Allocation For Java-Like Languages.

MLA 9

“Abstract Optimistic Stack Allocation For Java-Like Languages.” 2008.

Chicago

2008. “Abstract Optimistic Stack Allocation For Java-Like Languages.”

Harvard

(2008) ‘Abstract Optimistic Stack Allocation For Java-Like Languages’.

BibTeX

@article{anon2008abstract,
  title = {{Abstract Optimistic Stack Allocation For Java-Like Languages}},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.