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.

DOI: https://doi.org/10.1016/0167-8191(89)90127-0

URL: http://www.sciencedirect.com/science/article/pii/0...

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.

Viewing alternatives

Look up in Google Scholar

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions
No digital document available to download for this item

Item Actions

Export

About

CORE (COnnecting REpositories)

Recommendations