Bevan, David I.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1016/0167-8191(89)90127-0|
|Google Scholar:||Look up in Google Scholar|
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.|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Depositing User:||David Bevan|
|Date Deposited:||31 May 2012 08:23|
|Last Modified:||04 Oct 2016 11:17|
|Share this page:|