By Topic

Partitioned garbage collection of a large stable heap

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liskov, B. ; Lab. for Comput. Sci., MIT, Cambridge, MA, USA ; Maheshwari, U. ; Ng, T.

This paper describes a new garbage collection scheme for large persistent object stores. The scheme makes efficient use of the disk and main memory and does not delay applications. The heap is divided into partitions that are collected independently using stable information about inter-partition references. We use novel techniques to maintain this information using in-memory data structures and a log to avoid disk accesses. The result is a scheme that truly preserves the localized and scalable nature of partitioned collection

Published in:

Object-Orientation in Operating Systems, 1996., Proceedings of the Fifth International Workshop on

Date of Conference:

27-28 Oct 1996