Garbage collection is a fundamental component of memory management in several software frameworks. We present a general twodimensional Markovian model of a queue with garbage collection where the input process is Markov-modulated and the memory consumption can be modeled with discretisation. We derive important performance measures (also including garbage collection-related measures like mean g...

Managed memory, i.e., garbage collected memory, has gained wide-spread use because it relieves the programmer from freeing heap objects manually and allows for fast allocations. However, these advantages come at the cost of a difficult to understand memory manager and garbage collector. Therefore, searching for memory-related performance degredations is a tedious task because the reasons for sl...

This study sought to elicit a discussion about the significance of garbage from the standpoint of a group of municipal garbage collectors and garbage recyclers resident in Fortaleza, State of Ceará. Using qualitative methodology and the individual interview technique, this work presents the results of ongoing research that has been conducted together with the employees involved in the collectio...

Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation, works well in strict languages. In a lazy language, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...

Garbage collection is the automatic reclamation of computer storage Knu73, Coh81, Wil92, Wil95]. While in many systems, programmers must explicitly reclaim heap memory at some point in their program by using a \free" or \dispose" statement, garbage collected systems free the programmer from this burden. In spite of its obvious attractiveness for many applications, garbage collection for real-ti...

In generational garbage collection, the youngest generation of the heap is frequently traversed during garbage collection. Due to randomness of the traversal, memory access patterns are unpredictable and cache performance becomes crucial to garbage-collection efficiency. Our proposal to improve cache performance of garbage collection is to “pin” the youngest generation (sometimes called the nur...

The wide-scale deployment of multi-core and many-core processors will necessitate fundamental changes to garbage collectors. Highly parallel garbage collection is critical to the performance of these systems — today’s garbage collectors can quickly become the bottleneck for parallel programs. These processors will present additional new challenges — many contain non-uniform memory architectures...

We present a practical and e cient garbage collection mechanism for large scale distributed systems The mechanism collects all garbage including distributed cyclic garbage without global synchronization or back ward links The primary method used for local and remote garbage collection is timeouts each object has a time to live and clients which have a link to an ob ject must refresh the target ...