Bounded parallel garbage collection: Implementation and adaptation
F. A. Vaughan, William Brodie-Tyrrell, Katrina E. Falkner, D. S. Munro · 2001
Introduction Languages providing automatic storage management have recently begun to make considerable inroads into many areas of mainstream computer systems. However the lack of time and space constraints within the garbage collection mechanisms remains an impediment to the uptake of these more advanced languages in real time systems. Whilst some garbage collectors do provide bounded execution guarantees for single processor systems [Bak78], algorithms that can provide such guarantees for multiprocessor systems have only recently been forthcoming. A new algorithm proposed by Blelloch and Cheng [BC99] is one such example. The basics of garbage collection operation can be described simply. A program is executed by a mutator, which reads and writes existing objects, and may dynamically request the allocation of space for the storage of new objects. The execution environment possesses a number of roots of reachability, from which all useful object