Tenuring policies for generation-based storage reclamation
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Atomic garbage collection: managing a stable heap
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
A comparative performance evaluation of write barrier implementation
OOPSLA '92 conference proceedings on Object-oriented programming systems, languages, and applications
Partition selection policies in object database garbage collection
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Semi-automatic, self-adaptive control of garbage collection rates in object databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partitioned garbage collection of a large object store
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
IEEE Transactions on Knowledge and Data Engineering
Storage Reclamation and Reorganization in Client-Server Persistent Object Stores
Proceedings of the Tenth International Conference on Data Engineering
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
Incremental Garbage Collection of a Persistent Object Store using PMOS
Proceedings of the 8th International Workshop on Persistent Object Systems (POS8) and Proceedings of the 3rd International Workshop on Persistence and Java (PJW3): Advances in Persistent Object Systems
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Comparative performance evaluation of garbage collection algorithms
Comparative performance evaluation of garbage collection algorithms
Concurrent atomic garbage collection
Concurrent atomic garbage collection
Incremental garbage collection in massive object stores
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
| Hi-index | 0.00 |
Implementors of garbage collection algorithms are, in general, faced with determining a number of policy decisions such as when to collect, how to collect space or how to interact with the running application. With main memory collectors such decisions are usually influenced by results and experiences from a wealth of previous work. However, with partitioned collection of persistent objects stores, the implementor has a much smaller base to draw from. This is due not just to the small number of existing incremental object store collector implementations but also because the tradeoffs are significantly different from main-memory collection.This paper reports on investigations, using the PMOS collector, into policy choices determining which partition should be chosen for collection. A previous study on partition selection postulated that a flexible selection policy can significantly reduce I/O and increase the amount of space reclaimed. That study was based on simulations on a synthetic object database. Here we test these conclusions by repeating the experiments using real applications, a partitioned store collector and an implemented persistent object store.