The University of Dublin | Trinity College -- Ollscoil Átha Cliath | Coláiste na Tríonóide
Trinity's Access to Research Archive
Home :: Log In :: Submit :: Alerts ::

TARA >
School of Computer Science and Statistics >
Computer Science >
Computer Science (Scholarly Publications) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2262/32312

Title: Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events.
Other Titles: Proceedings - International Conference on Distributed Computing Systems,
International Conference on Distributed Computing Systems,
Author: CAHILL, VINNY
Author's Homepage: http://people.tcd.ie/vjcahill
Keywords: Computer Science
Issue Date: 1997
Publisher: IEEE
Citation: Louboutin, Sylvain R.Y., Cahill, Vinny, Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events., Proceedings - International Conference on Distributed Computing Systems,, International Conference on Distributed Computing Systems,, Baltimore, MD, 27-30 May, IEEE, 1997, 516-525
Abstract: Comprehensive distributed garbage collection an objectoriented distributed systems has mostly been addressed via distributed versions of graph-tracing algorithms, a legacy of centralised garbage collection techniques. Two features jeopardise the scalability of these approaches: the bottleneck associated with having to reach a global consensus before any resource can actually be reclaimed, and the overhead of eager log-keeping. This paper describes an alternative approach to comprehensave distributed garbage collection that entails computing the vector-time characterising the causal history of some relevant events of the mutator processes computations. Knowing the causal histories of these events makes it possible to identify garbage objects that are not identifiable by means of per-site garbage collection alone. Computing the vector-times necessary to identify garbage is possible without the unbounded space overheads usually associated with dynamically reconstructing vector-times of arbitrary events of distributed computations. Our approach integrates a lazy logkeeping mechanism and therefore tackles both of the aforementioned stumbling blocks of distributed garbage
Description: PUBLISHED
Baltimore, MD
URI: http://hdl.handle.net/2262/32312
Appears in Collections:Computer Science (Scholarly Publications)

Files in This Item:

File Description SizeFormat
Comprehensive.pdfpublished (publisher copy) peer-reviewed993.49 kBAdobe PDFView/Open


This item is protected by original copyright


Please note: There is a known bug in some browsers that causes an error when a user tries to view large pdf file within the browser window. If you receive the message "The file is damaged and could not be repaired", please try one of the solutions linked below based on the browser you are using.

Items in TARA are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback