ABSTRACT< i> Garbage-First</i> is a server-style garbage collector, targeted for multi-
processors with large memories, that meets a soft real-time goal with high probability, while
achieving high throughput. Whole-heap operations, such as global marking, are performed …

ABSTRACT C4, the Continuously Concurrent Compacting Collector, an updated
generational form of the Pauseless GC Algorithm [7], is introduced and described, along with
details of its implementation on modern X86 hardware. It uses a read barrier to support …

Modern transactional response-time sensitive applications have run into practical limits on
the size of garbage collected heaps. The heap can only grow until GC pauses exceed the
response-time limits. Sustainable, scalable concurrent collection has become a feature …

The widely used Mark-and-Sweep garbage collector has a drawback in that it does not
move objects during collection. As a result, large long-running realistic applications, such as
Web application servers, frequently face the fragmentation problem. To eliminate …

Programmers are increasingly choosing managed languages for modern applications,
which tend to allocate many short-to-medium lived small objects. The garbage collector
therefore directly determines program performance by making a classic space-time tradeoff …

This paper reports our experiences with a mostly-concurrent incremental garbage collector,
implemented in the context of a high performance virtual machine for the Java™
programming language. The garbage collector is based on the “mostly parallel” collection …

Published in 1996, Richard Jones's Garbage Collection was a milestone in the area of
automatic memory management. The field has grown considerably since then, sparking a
need for an updated look at the latest state-of-the-art developments. The Garbage Collection …

Regional garbage collection offers a useful compromise between real-time and generational
collection. Regional collectors resemble generational collectors, but are scalable: our main
theorem guarantees a positive lower bound, independent of mutator and live storage, for the …

We present Stopless: a concurrent real-time garbage collector suitable for modern
multiprocessors running parallel multithreaded applications. Creating a garbage-collected
environment that supports real-time on modern platforms is notoriously hard, especially if …

Concurrent garbage collection is highly attractive for real-time systems, because offloading
the collection effort from the executing threads allows faster response, allowing for extremely
short deadlines at the microseconds level. Concurrent collectors also offer much better …