Incremental algorithms are often used to interleave the work of a garbage collector with the execution of an application program, the intention being to avoid long pauses. However, overestimating the worst-case storage needs of the program often causes all the garbage collection work to be performed in the beginning of the garbage collection cycles, slowing down the application program to an un...

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

A lmost everywhere, routing plays an important role in everyday life. This thesis consists of three parts, each studying different applications where routing decisions are coordinated with other decisions. In the first part, an application concerning waste management is presented. Many industries generate garbage, and instead of handling the waste disposal themselves, other companies, specializ...

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