In this paper (chapter) I describe several classes of garbage collection algorithms, and provide a few examples (both real and hypothetical) of each. This collection is by no means complete; Cohen [Coh81] presents an exhaustive collection, but I am more interested in describing a few representative collectors in detail and providing examples for a later paper (chapter) on garbage collection and...

OBJECTIVES To prospectively assess respiratory health in wastewater workers and garbage collectors over 5 years. METHODS Exposure, respiratory symptoms and conditions, spirometry and lung-specific proteins were assessed yearly in a cohort of 304 controls, 247 wastewater workers and 52 garbage collectors. Results were analysed with random coefficient models and linear regression taking into ac...

Semispace garbage collectors relocate all the live objects in one step, which is simple and leads to good performance. Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects. As much as half of the heap could be reserved as it is possible that all the allocated objects survive. In reality, however, most programs exhibit a high infant morta...

Orthogonally persistent automatic storage management provides a useful abstraction over stable secondary storage, in contrast to manual storage management which is complex, error-prone and tedious. The provision of the persistence abstraction over a cluster of storage nodes provides this abstraction in conjunction with mainframe-level aggregate IO performance, necessary for the support of high ...

Memory managers are an important part of any modern language: they are used to dynamically allocate memory for use in the program. Many managers exist and depending on the operating system and language. However, two major types of managers can be identified: manual memory allocators and garbage collectors. In the case of manual memory allocators, the programmer must manually release memory back...

We give an algebraic characterisation of reachability and non-reachability in modal Kleene algebras. By this we derive a general algorithm for garbage collectors and present some further algebraic optimisations. The given approach is fully expressible in first-order logic and hence provides an abstract and general framework for automated and machine-verified derivations of garbage collecting al...

Garbage collectors must minimize the scarce resources of cache space and off-chip communications bandwidth to optimize performance on modern single-chip computer architectures. Strategies for achieving these goals in the context of copying garbage collection are discussed. A multi-processor mutator/collector system is analyzed. Finally, the Intel 80860XP architecture is studied.

Modern garbage collectors partition the set of heap objects to achieve the best performance. For example, generational garbage collectors partition objects by age and focus their efforts on the youngest objects. Partitioning by age works well for many programs because younger objects usually have short lifetimes and thus garbage collection of young objects is often able to free up many objects....

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 ...