Accurate Garbage Collection in Uncooperative Environments Revisited

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207477" target="_blank" >RIV/00216208:11320/09:00207477 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Accurate Garbage Collection in Uncooperative Environments Revisited

Popis výsledku v původním jazyce

A popular approach to implementing a real-time Java system is via translation to lower-level languages such as C or C++. As Java is a garbage collected language, however, C/C++ are not a perfect match as no support is provided for accurately discoveringpointers to heap-allocated data on thread stacks. We evaluate several previously published techniques and propose a new mechanism, lazy pointer stacks, for performing accurate garbage collection in such uncooperative environments. We implemented the newtechnique in the Ovm Java virtual machine with our own Java-to-C/C++ compiler using GCC as a back-end compiler. Our extensive experimental results confirm that lazy pointer stacks outperform existing approaches: we provide a speedup of 4.5% over Henderson's accurate collector with a 17% increase in code size.

Název v anglickém jazyce

Accurate Garbage Collection in Uncooperative Environments Revisited

Popis výsledku anglicky

A popular approach to implementing a real-time Java system is via translation to lower-level languages such as C or C++. As Java is a garbage collected language, however, C/C++ are not a perfect match as no support is provided for accurately discoveringpointers to heap-allocated data on thread stacks. We evaluate several previously published techniques and propose a new mechanism, lazy pointer stacks, for performing accurate garbage collection in such uncooperative environments. We implemented the newtechnique in the Ovm Java virtual machine with our own Java-to-C/C++ compiler using GCC as a back-end compiler. Our extensive experimental results confirm that lazy pointer stacks outperform existing approaches: we provide a speedup of 4.5% over Henderson's accurate collector with a 17% increase in code size.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Concurrency and Computation: Practice and Experience

ISSN

1532-0626

e-ISSN

—

Svazek periodika

21

Číslo periodika v rámci svazku

12

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

35

Strana od-do

—

Kód UT WoS článku

000268546500003

EID výsledku v databázi Scopus

—