2007Unpublished venueRequires access

Exploiting the efficiency of generational algorithms for hardware-supported real-time garbage collection

Sylvain Stanchina, Matthias Meyer

Open publisher page 3 citations

Abstract

Generational garbage collectors are more efficient than their non-generational counterparts. Unfortunately, however, generational algorithms require both write barriers and write barrier handlers and therefore degrade worst-case performance.

About this research paper

What this paper is about

Generational garbage collectors are more efficient than their non-generational counterparts. Unfortunately, however, generational algorithms require both write barriers and write barrier handlers and therefore degrade worst-case performance.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Generational garbage collectors are more efficient than their non-generational counterparts. Unfortunately, however, generational algorithms require both write barriers and write barrier handlers and therefore degrade worst-case performance.

Key concepts: Garbage collection, Garbage, Computer science, Manual memory management, Execution time, Data collection, Algorithm, Real-time computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Exploiting the efficiency of generational algorithms for hardware-supported real-time garbage collection — Research Paper | ScholarLens