45 search results - page 8 / 9 » Live heap space analysis for languages with garbage collecti... |
PLDI
2010
ACM
13 years 10 months ago
2010
ACM
Arrays are the ubiquitous organization for indexed data. Throughout programming language evolution, implementations have laid out arrays contiguously in memory. This layout is pro...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
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...
IFL
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
JAVA
1999
Springer
13 years 9 months ago
1999
Springer
User-level network interfaces (UNIs) have reduced the overheads of communication by exposing the buffers used by the network interface DMA engine to the applications. This removes...
OOPSLA
2004
Springer
13 years 10 months ago
2004
Springer
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...