62 search results - page 7 / 13 » Are Fibonacci Heaps Optimal |
ICSE
2011
IEEE-ACM
12 years 11 months ago
2011
IEEE-ACM
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
CGO
2007
IEEE
14 years 1 months ago
2007
IEEE
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
IWMM
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we investigate the effects of using three different nursery sizing policies on overall and garbage collection performances. As part of our investigation, we modify ...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
IWMM
2011
Springer
12 years 10 months ago
2011
Springer
To achieve optimal performance, garbage-collected applications must balance the sizes of their heaps dynamically. Sizing the heap too small can reduce throughput by increasing the...