A classical problem in distributed systems is detecting the termination of a distributed computation. Distributed Termination Detection (DTD) has been extensively studied in the past twenty years and it is known to be a difficult problem to solve efficiently, because it involves properties of the global state of a distributed …
read moreBack To The Future: A Family of DTD Algorithms
We discuss our work-in-progress on a number of Distributed Termination Detection Algorithms. These algorithms use message histories to construct administrative trees called message futures. These algorithms allow generalized network topologies and support dynamic changes to the network. The performance of these algorithms can be optimized with special information about the …
read more