Replicating Real-Time Garbage Collector

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10103303" target="_blank" >RIV/00216208:11320/11:10103303 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1002/cpe.1669" target="_blank" >http://dx.doi.org/10.1002/cpe.1669</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1002/cpe.1669" target="_blank" >10.1002/cpe.1669</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Replicating Real-Time Garbage Collector

Popis výsledku v původním jazyce

Real-time Java is becoming a viable platform for real-time applications, bringing new challenges to a garbage collector. A real-time collector has to be incremental as not to cause deadline misses by suspending an application for too long. In particular,if a real-time collector has to relocate objects in the heap, it must do so incrementally and transparently to the application. This is usually achieved via an indirection that has to be followed on every read and write to the heap. We present an alternative solution, based on object replication, which does not need any special handling for memory reads, but writes are more expensive: every value is written twice. As writes are less frequent than reads, the total overhead is reduced. With our implementation in a research real-time Java VM and DaCapo, pseudo-jbb, and SPEC JVM 98 benchmarks, we observe an average speed-up of 4% on a Linux/x86 platform.

Název v anglickém jazyce

Replicating Real-Time Garbage Collector

Popis výsledku anglicky

Real-time Java is becoming a viable platform for real-time applications, bringing new challenges to a garbage collector. A real-time collector has to be incremental as not to cause deadline misses by suspending an application for too long. In particular,if a real-time collector has to relocate objects in the heap, it must do so incrementally and transparently to the application. This is usually achieved via an indirection that has to be followed on every read and write to the heap. We present an alternative solution, based on object replication, which does not need any special handling for memory reads, but writes are more expensive: every value is written twice. As writes are less frequent than reads, the total overhead is reduced. With our implementation in a research real-time Java VM and DaCapo, pseudo-jbb, and SPEC JVM 98 benchmarks, we observe an average speed-up of 4% on a Linux/x86 platform.

Druh

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

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2011

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 Computation Practice and Experience

ISSN

1532-0626

e-ISSN

—

Svazek periodika

23

Číslo periodika v rámci svazku

14

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

19

Strana od-do

1646-1664

Kód UT WoS článku

000295292900004

EID výsledku v databázi Scopus

—