Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Starting with termination: A methodology for building distributed garbage collection algorithms|
|Citation:||24th Australasian Computer Science Conference : ACSC 2001 : proceedings : 29 January-2 February, 2001, Gold Coast, Queensland, Australia / edited by Michael Oudshoorn : pp. 20-28|
|Publisher:||IEEE COMPUTER SOCIETY|
|Publisher Place:||LOS ALAMITOS, CALIFORNIA, USA|
|Series/Report no.:||AUSTRALIAN COMPUTER SCIENCE COMMUNICATIONS|
|Conference Name:||Australasian Computer Science Conference (24th : 2001 : Gold Coast, Qld.)|
|Stephen M. Blackburn, Richard L. Hudson, Ron Morrison, J. Eliot B. Moss, David S. Munro, and John Zigman|
|Abstract:||We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manner that preserves interesting properties of the original collector, such as completeness. To illustrate our technique, we show how two distributed termination algorithms, credit recovery and task balancing, may be suitably described; and then map four centralized garbage collectors: reference counting; mark/scan; a generational scheme; and the Mature Object Space collector (MOS) onto this description. The advantage of our approach is that by separating the issues of distribution and collection, we alleviate the difficulty of inventing, understanding, and comparing distributed garbage collection techniques.|
|Rights:||© Copyright 2001 IEEE|
|Appears in Collections:||Aurora harvest 2|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.