Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
A distributed garbage collection algorithm
Proc. of a conference on Functional programming languages and computer architecture
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Distributed garbage collection using reference counting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Distributed garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Global garbage collection for distributed heap storage systems
International Journal of Parallel Programming
Garbage collection: an exercise in distributed, fault-tolerant programming
Garbage collection: an exercise in distributed, fault-tolerant programming
Tenuring policies for generation-based storage reclamation
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Generational reference counting: a reduced-communication distributed storage reclamation scheme
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
The Amber system: parallel programming on a network of multiprocessors
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Incremental distribution of timestamp packets: a new approach to distributed garbage collection
OOPSLA '89 Conference proceedings on Object-oriented programming systems, languages and applications
A protocol for distributed reference counting
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Managing Reentrant Structures Using Reference Counts
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
A real-time garbage collector based on the lifetimes of objects
Communications of the ACM
Performance analysis of on-the-fly garbage collection
Communications of the ACM
An empirical study of list structure in Lisp
Communications of the ACM
List processing in real time on a serial computer
Communications of the ACM
Guardians and actions: linguistic support for robust, distributed programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Parallel Asynchronous Garbage Collection Algorithm for Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Parallel garbage collection for graph machines
Proceedings of the Workshop on Graph Reduction
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Decentralized object finding using forwarding addresses (object, network, distribution)
Decentralized object finding using forwarding addresses (object, network, distribution)
Partition selection policies in object database garbage collection
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Collecting cyclic distributed garbage by controlled migration
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Indirect distributed garbage collection: handling object migration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Research Frontiers in Object Technology
Information Systems Frontiers
A Highly Effective Partition Selection Policy for Object Database Garbage Collection
IEEE Transactions on Knowledge and Data Engineering
Garbage collection in message passing distributed systems
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
An algorithm for garbage collection in distributed systems with object sharing across processor boundaries is described. The algorithm allows local garbage collection at each node in the system to proceed independently of local collection at the other nodes. It requires no global synchronization or knowledge of the global state of the system and exhibits the capability for graceful degradation. The concept of a specialized dump node is proposed to facilitate the collection of inaccessible circular structures. An experimental evaluation of the algorithm is also described. The algorithm is compared with a corresponding scheme that requires global synchronization. The results show that the algorithm works well in distributed processing environments even when the locality of object references is low.