Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A distributed garbage collection algorithm
Proc. of a conference on Functional programming languages and computer architecture
Design for a multiprocessing heap with on-board reference counting
Proc. of a conference on Functional programming languages and computer architecture
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
"Algorithms for on-the-fly garbage collection" revisited
Information Processing Letters
Performance of symbolic applications on a parallel architecture
International Journal of Parallel Programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Performance analysis of on-the-fly garbage collection
Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
The Science of Programming
Supporting ada memory management in the iAPX-432
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Distributed resource management: garbage collection
Distributed resource management: garbage collection
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Collecting cyclic distributed garbage by controlled migration
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Garbage Collection in a Distributed Object-Oriented System
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.