Replicating Real-Time Garbage Collector

Result code in 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>
Result on the web
<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>

Result language
angličtina
Original language name
Replicating Real-Time Garbage Collector
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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

Similar results(10)