For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Kent

Return to search Previous output Next output
Output 43 of 117 in the submission
Output title

Handles revisited: optimising performance and memory costs in a real-time collector

Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the 10th International Symposium on Memory Management (ISMM)
Volume number
-
Issue number
-
First page of article
182
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
1
Additional information

<07> Long ago, JVM implementers abandoned handles in favour of direct pointers to objects, for better throughput. Our EPSRC project EP/H026975/1 showed, surprisingly, a handle-based compacting garbage collector (GC) incurs no overhead compared with a state of the art direct-pointer implementation. This is significant. First, handles offer greater flexibility, allowing object movement at any time rather than only at the end of a GC, offering the opportunity to reduce memory overhead. Second, handles are compatible with compilers that do not expect references to change. Our technique has been adopted by the GAP computer algebra system, reducing GC times by 10%.

Interdisciplinary
-
Cross-referral requested
-
Research group
P - Programming Languages and Systems Group
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
Yes
Non-English
No
English abstract
-