Current real-time garbage collection algorithms are usually criticised for their high memory requirements. Even when consuming nearly 50% of cpu time, some garbage collectors ask for at least twice the memory as really needed. This report explores the fundamental reason of this problem and proposes new metrics for real-time garbage collection algorithm designs. Use of these metrics motivate an ...

Scheme uses garbage collection for heap memory management. Ideally, garbage collectors should be able to reclaim all dead objects, i.e. objects that will not be used in future. However, garbage collectors collect only those dead objects that are not reachable from any program variable. Dead objects that are reachable from program variables are not reclaimed. In this paper we describe our experi...

A systematic, global and integration concept is applied upon garbage disposal problem caused by the substantial increase of garbage in China's cities and towns to promote the coordinated development of garbage stations. A kind of echelon pattern of urban circle solid waste disposal is put forward as well as five key technologies which are essential to be used in the pattern. The echelon pattern...

This thesis presents an examination of design patterns within the context of garbage collection. Initially, I review garbage collection and design patterns. Four garbage collectors are then examined and the design patterns found described. Both domain speci c and generic patterns are described. The domain speci c patterns are TriColour and RootSet, the generic patterns are Adaptor, Facade, Iter...

Little work has been done in garbage collection algorithms for distributed shared memory systems. Mosaic is a safe and complete garbage collection system that collects garbage in object systems that are implemented above page-based distributed shared memory systems. It is non-intrusive in its impact on application performance. Mosaic partitions the virtual address space into separately managed ...