A Scalable Algorithm for Decentralized Actor Termination Detection
Dan Plyukhin, Gul Agha

TL;DR
This paper introduces DRL, a decentralized, low-overhead algorithm for detecting actor termination in distributed systems, improving concurrency and scalability over previous methods.
Contribution
It presents a novel asynchronous, decentralized termination detection algorithm for actor systems that tolerates network partitions and reduces coordination overhead.
Findings
DRL accurately detects terminated actors ensuring safety.
DRL guarantees eventual detection of all terminated actors under certain assumptions.
The method is scalable and suitable for distributed actor frameworks.
Abstract
Automatic garbage collection (GC) prevents certain kinds of bugs and reduces programming overhead. GC techniques for sequential programs are based on reachability analysis. However, testing reachability from a root set is inadequate for determining whether an actor is garbage: Observe that an unreachable actor may send a message to a reachable actor. Instead, it is sufficient to check termination (sometimes also called quiescence): an actor is terminated if it is not currently processing a message and cannot receive a message in the future. Moreover, many actor frameworks provide all actors with access to file I/O or external storage; without inspecting an actor's internal code, it is necessary to check that the actor has terminated to ensure that it may be garbage collected in these frameworks. Previous algorithms to detect actor garbage require coordination mechanisms such as causal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
