Algorithms for on-the-fly garbage collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Computing
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
A new approach to detection of locally indicative stability
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
An efficient garbage collection scheme for parallel computer architectures
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
"Algorithms for on-the-fly garbage collection" revisited
Information Processing Letters
The derivation of graph marking algorithms from distributed termination detection protocols
Science of Computer Programming
Global quiescence detection based on credit distribution and recovery
Information Processing Letters
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
A message-optimal algorithm for distributed termination detection
Journal of Parallel and Distributed Computing
Legally speaking: should program algorithms be patented
Communications of the ACM
Indirect reference counting: a distributed garbage collection algorithm
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
A protocol for distributed reference counting
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
On-the-fly garbage collection: an exercise in cooperation
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE
AN ABSTRACT IMPLEMENTATION FOR A GENERALIZED DATA FLOW LANGUAGE
Locality, causality and continuations
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Indirect distributed garbage collection: handling object migration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical distributed reference counting
Proceedings of the 1st international symposium on Memory management
A distributed garbage collector with diffusion tree reorganisation and mobile objects
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Starting with termination: a methodology for building distributed garbage collection algorithms
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation
Higher-Order and Symbolic Computation
Termination Detection of Distributed Algorithms by Graph Relabelling Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Implementing a family of distributed garbage collectors
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Strong stable properties in distributed systems
Distributed Computing
Birrell's distributed reference listing revisited
ACM Transactions on Programming Languages and Systems (TOPLAS)
Scientific Programming
An efficient delay-optimal distributed termination detection algorithm
Journal of Parallel and Distributed Computing
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing
Communication analysis of distributed programs
Scientific Programming - Parallel/High-Performance Object-Oriented Scientific Computing (POOSC '05), Glasgow, UK, 25 July 2005
Design, Implementation and Deployment of State Machines Using a Generative Approach
Architecting Dependable Systems V
Engineering an agent-based peer-to-peer resource discovery system
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Detecting Locally Distributed Predicates
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Efficient reduction for wait-free termination detection in a crash-prone distributed system
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the “mark-and-sweep” type as well as to reference-counting protocol of Lermen and Maurer, the weighted-reference-counting protocol, the local-reference-counting protocol, and Ben-Ari's mark-and-sweep collector into termination detection algorithms. Known termination detection algorithms as well as new variants are obtained.