This paper describes a new garbage collection scheme for large persistent object stores that makes efficient use of the disk and main memory. The heap is divided into partitions that are collected independently using information about inter-partition references. We present efficient techniques to maintain this information stably using auxiliary data structures in memory and the log. The result ...

Garbage collection algorithms have a profound impact on the performance and life span of flash-based solid state drives. Recently, the d-choices garbage collection algorithm was shown to provide an excellent tradeoff between simplicity and performance [21]. In this paper, we introduce the d-choices garbage collection algorithm with memory and analyze its write performance using both synthetic a...

We present some results and raise some issues regarding benchmarks for evaluating garbage collection in persistent distributed stores. We believe that such issues are relevant due to increasing research activity in this domain. Therefore, deening widely accepted benchmarks to evaluate the performance and impact of garbage collection solutions is urgent. Currently, the performance of garbage col...

Expiration classes are a concept to analyze memory management systems. It reveals the costs and the source of costs. Explicit memory management, garbage collection, region-based memory management and cyclic allocation are analyzed in this master thesis. Furthermore, we present AGC, a new memory management system which combines garbage collection with cyclic allocation. Cyclic allocation has ver...

In NAND flash memory devices, pages marked “invalid” can remain in blocks and occupy flash space. Therefore, it is necessary to physically eliminate invalid pages and collect valid pages from the victim blocks in order to sustain flash write performance and storage lifespan. Although there have been many research studies on efficient garbage collection techniques, research has focused on victim...