By Topic

Reliable garbage collection in distributed object oriented systems

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
$33 $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

2 Author(s)
A. Gupta ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; W. K. Fuchs

Examines the problem of reliable storage reclamation in a distributed object-oriented system. A distributed algorithm is proposed that utilizes a modified reference counting strategy for intermode pointers and mark-and-sweep for local garbage collection. The algorithm allows nodes to fail in a failstop manner, in which case the global garbage collection functions in a gracefully degraded mode of operation. Compaction of objects is supported and object locality is exploited to reduce overhead.<>

Published in:

Computer Software and Applications Conference, 1988. COMPSAC 88. Proceedings., Twelfth International

Date of Conference:

5-7 Oct. 1988