Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amsaleg, L., Franklin, M. & Gruber, O. „Efficient Incremental Garbage Collection for Workstation/Server Database Systems“. ESPRIT BRA Project 6309 FIDE2 (1994).
Brown, A.L., Dearle, A., Morrison, R., Munro, D. & Rosenberg, J. „A Layered Persistent Architecture for Napier88“. In Security and Persistence, Rosenberg, J. & Keedy, J.L. (ed), Springer-Verlag (1990) pp 155–172.
Bishop, P.B. „Computer systems with a very large address space and garbage collection.“. Ph.D. Thesis, Massachusetts Institute of Technology (1977).
Campin, J. & Atkinson, M.P. „A Persistent Store Garbage Collector with Statistical Facilities“. Universities of Glasgow and St Andrews (1986).
Cook, J.E., Klauser, A., Wolf, A.L. & Zorn, B.G. „Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Object Databases“. In Proc. ACM SIGMOD International Conference on Management of Data, Montreal, Canada (1996) pp 377–388.
Cattell, R.G.G. & Skeen, J. „Object Operations Benchmark“. ACM Transactions on Database Systems 17,1 (1992) pp 1–31.
Cook, J.E., Wolf, A.L. & Zorn, B.G. „Partition selection policies in object database garbage collection“. In Proc. ACM SIGMOD International Conference on Management of Data, Minneapolis, MN (1994) pp 371–382.
Cook, J.E., Wolf, A.L. & Zorn, B.G. „A Highly Effective Partition Selection Policy for Object Database Garbage Collection.“. IEEE Transactions on Knowledge and Data Engineering 10,1 (1998) pp 153–172.
Detlefs, D.L. „Concurrent Atomic Garbage Collection“. Ph.D. Thesis, Carnegie-Mellon University (1989).
Hosking, A., Moss, J.E.B. & Stefanovic, D. „A Comparative Performance Evaluation of Write Barrier Implementations“. In Proc. Proceedings of the ACM Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), Vancouver, Canada (1992) pp 92–109.
Kolodner, E., Liskov, B. & Weihl, W. „Atomic Garbage Collection: Managing a Stable Heap“. In Proc. ACM SIGMOD International Conference on the Management of Data, Portland, Oregon (1989) pp 15–25.
Munro, D.S., Brown, A.L., Morrison, R. & Moss, J.E.B. „Incremental Garbage Collection of a Persistent Object Store using PMOS“. In Advances in Persistent Object Systems, Morrison, R., Jordan, M. & Atkinson, M.P. (ed), Morgan Kaufmann (1999) pp 78–91.
Maheshwari, U. & Liskov, B. „Partitioned Garbage Collection of a Large Object Store“. In Proc. ACM SIGMOD’97, Phoenix, Arizona (1997) pp 313–323.
Moss, J.E.B., Munro, D.S. & Hudson, R.L. „PMOS: A Complete and Coarse-Grained Incremental Garbage Collector for Persistent Object Stores“. In Proc. 7th International Workshop on Persistent Object Systems (POS7), Cape May, NJ, USA (1996).
Unger, D. & Jackson, F. „Tenuring Policies for Generation-Based Storage Reclamation“. In Proc. OOPSLA (1988) pp 1–17.
Ungar, D. „Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm“. ACM SIGPLAN Notices 19,5. Proc. ACM SIGPLAN Notices Software Engineering Symposium on Practical Software Development Environments, Pittsburgh PA (1984) pp 157–167.
Wilson, P.R. „Uniprocessor Garbage Collection Techniques“. In Lecture Notes in Computer Science 637, Springer-Verlag (1992) pp 1–42.
Wilson, P.R., Johnstone, M.S., Neely, M. & Boles, D. „Dynamic Storage Allocation: A Survey and Critical Review“. In Lecture Notes in Computer Science 986, Baker, H.G. (ed), Springer-Verlag (1995) pp 1–116.
Yong, V., Naughton, J. & Yu, J. „Storage Reclamation and reorganization in client-server persistent object stores“. In Proc. 10th International Conference on Data Engineering (1994) pp 120–131.
Zorn, B.G. „Comparative Performance Evaluation of Garbage Collection Algorithms“. Ph.D. Thesis, University of California at Berkeley (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munro, D.S., Brown, A.L. (2001). Evaluating Partition Selection Policies Using the PMOS Garbage Collector. In: Kirby, G.N.C., Dearle, A., Sjøberg, D.I.K. (eds) Persistent Object Systems: Design, Implementation, and Use. POS 2000. Lecture Notes in Computer Science, vol 2135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45498-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-45498-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42735-3
Online ISBN: 978-3-540-45498-4
eBook Packages: Springer Book Archive