Birrell's Distributed Reference Listing Revisited
Birrell's Distributed Reference Listing Revisited
The Java RMI collector is arguably the most widely used distributed garbage collector. Its distributed reference listing algorithm was introduced by Birrell in the context of Network Objects, where the description was informal and heavily biased toward implementation. In this paper, we formalise this algorithm in an implementation-independent manner, which allows us to clarify weaknesses of the initial presentation. In particular, we discover cases critical to the correctness of the algorithm that are not accounted for by Birrell. We use our formalisation to derive an invariant-based proof of correctness of the algorithm that avoids notoriously difficult temporal reasoning. Furthermore, we offer a novel graphical representation of the state transition diagram, which we use to provide intuitive explanations of the algorithm and to investigate its tolerance to faults in a systematic manner. Finally, we examine how the algorithm may be optimised, either by placing constraints on message channels or by tightening the coupling between application program and distributed garbage collector.
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Dickman, Peter
bfdf1274-86d2-4d9e-9534-e43e832bbeae
Jones, Richard
b23db33c-778b-4560-9c06-eb8af3bc3fb6
July 2003
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Dickman, Peter
bfdf1274-86d2-4d9e-9534-e43e832bbeae
Jones, Richard
b23db33c-778b-4560-9c06-eb8af3bc3fb6
Moreau, Luc, Dickman, Peter and Jones, Richard
(2003)
Birrell's Distributed Reference Listing Revisited
University of Kent
Record type:
Monograph
(Project Report)
Abstract
The Java RMI collector is arguably the most widely used distributed garbage collector. Its distributed reference listing algorithm was introduced by Birrell in the context of Network Objects, where the description was informal and heavily biased toward implementation. In this paper, we formalise this algorithm in an implementation-independent manner, which allows us to clarify weaknesses of the initial presentation. In particular, we discover cases critical to the correctness of the algorithm that are not accounted for by Birrell. We use our formalisation to derive an invariant-based proof of correctness of the algorithm that avoids notoriously difficult temporal reasoning. Furthermore, we offer a novel graphical representation of the state transition diagram, which we use to provide intuitive explanations of the algorithm and to investigate its tolerance to faults in a systematic manner. Finally, we examine how the algorithm may be optimised, either by placing constraints on message channels or by tightening the coupling between application program and distributed garbage collector.
Text
content
- Author's Original
More information
Published date: July 2003
Additional Information:
Technical Report 8-03, University of Kent, Computing Laboratory, Canterbury
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 259448
URI: http://eprints.soton.ac.uk/id/eprint/259448
PURE UUID: 036f3917-03a8-48f6-b659-6f168dbe8e05
Catalogue record
Date deposited: 28 Jun 2004
Last modified: 15 Mar 2024 21:25
Export record
Contributors
Author:
Luc Moreau
Author:
Peter Dickman
Author:
Richard Jones
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics