The Open UniversitySkip to content
 

An efficient reference counting solution to the distributed garbage collection problem

Bevan, David I. (1989). An efficient reference counting solution to the distributed garbage collection problem. Parallel Computing, 9(2) 179 - 192.

URL: http://www.sciencedirect.com/science/article/pii/0...
DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1016/0167-8191(89)90127-0
Google Scholar: Look up in Google Scholar

Abstract

A good programming language permits the programmer to concentrate on his application rather than on low-level implementation details. In particular, he does not have to concern himself with storage allocation because memory management is dealt with efficiently by the implementation of the language. To reclaim disused storage for reuse the implementation incorporates a garbage collection algorithm. When the language is implemented on a distributed multiprocessor architecture, this algorithm ideally collects garbage as soon as it is created and has minimal overheads in terms of space requirements and interprocess communications. We describe here an elegant algorithm with these properties which makes use of reference counting.

Item Type: Journal Article
Copyright Holders: 1989 Elsevier B.V.
ISSN: 0167-8191
Keywords: garbage collection
Academic Unit/Department: Mathematics, Computing and Technology
Item ID: 33665
Depositing User: David Bevan
Date Deposited: 31 May 2012 08:23
Last Modified: 31 May 2012 08:23
URI: http://oro.open.ac.uk/id/eprint/33665
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk