Title
An efficient reference counting solution to the distributed garbage collection problem
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.
Year
DOI
Venue
1989
10.1016/0167-8191(89)90127-0
PARALLEL COMPUTING
Keywords
Field
DocType
reference counting,circular structures,garbage collection,distributed systems
Garbage,Programmer,Computer science,Mark-compact algorithm,Manual memory management,Parallel computing,Reference counting,Memory management,Garbage collection,Garbage in, garbage out,Operating system
Journal
Volume
Issue
ISSN
9
2
0167-8191
Citations 
PageRank 
References 
9
0.70
15
Authors
1
Name
Order
Citations
PageRank
David I Bevan190.70