Synchronized Distributed Termination

Szymański, Bolesław K.; Shi, Yijun; Prywes, Noah S.

doi:10.1109/tse.1985.231861

Cited by 24 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, in a finite computation only information about a bounded region in the network can be gathered. The algorithm by Szymanski, Shy, and Prywes [23] does this for a region of pre-specified diameter; the assumption is necessary that a bound of the diameter of the entire network is known. This implies, that termination detection, unlike symmetry breaking, is possible in every graph, but provided some knowledge.…”

Section: Second Step: An Election Algorithm For a Family Of Labelled mentioning

confidence: 99%

Election in partially anonymous networks with arbitrary knowledge in message passing systems

2012

View full text Add to dashboard Cite

This paper attempts to find an answer to an open question of Angluin in her seminal paper (1980) about the election problem for families of graphs (Section 4, page 87). More precisely, we characterize families of (labelled) graphs which admit an election algorithm in the message passing model by using the notion of quasi-coverings which captures "the existence of large enough area of one graph that looks locally like another graph".

show abstract

Section: Second Step: An Election Algorithm For a Family Of Labelled mentioning

confidence: 99%

Election in partially anonymous networks with arbitrary knowledge in message passing systems

2012

View full text Add to dashboard Cite

show abstract

“…We give algorithms based on the composition of an algorithm by Szymanski, Shy, and Prywes (Szymanski et al, 1985) with the Chandy-Lamport (Chandy and Lamport, 1985) algorithm which enable each process to detect an instant where all processes have obtained their local snapshot and to evaluate global predicates anonymously. registerVariable("label end", label); setTerminated(true); end Algorithm 1: Example of a broadcast algorithm written in Java using the API of ViSiDiA.…”

Section: Debugging Distributed Algorithmsmentioning

confidence: 99%

“…More precisely, it requires that all processes certify, in a finite computation, that they have completed the computation of the local snapshot. The algorithm by Szymanski, Shy, and Prywes (the SSP algorithm for short) (Szymanski et al, 1985) does this for a region of pre-specified diameter; the assumption is necessary that an upper bound of the diameter of the entire network is known by each process (note that the network size also suffices). In the sequel this upper bound is denoted by β and we assume that each process knows it.…”

Section: Termination Detection Of the Chandy-lamport Snapshot Algorithmmentioning

confidence: 99%

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Aguerre¹,

Morsellino²,

Mosbah³

2012

Proceedings of the International Conference on Computer Graphics Theory and Applications

View full text Add to dashboard Cite

Abstract:The debugging of distributed algorithms is a major challenge which greatly benefits from the help of an interactive and informative human-computer interface. In this paper we present ViSiDiA, a platform for the visualization, simulation and debugging of distributed algorithms. Our approach respects real-life constraints such as process anonymity and privacy, network synchronicity. We propose a new fully-distributed method for the debugging and monitoring of distributed systems, based on the computation of global states and global predicates from local information in anonymous and asynchronous networks. We show how the debug information can be visualized concurrently with the algorithm execution.

show abstract

“…This algorithm is a combination of an election algorithm for symmetric minimal graphs presented in [CM07] and a generalization of an algorithm of Szymanski, Shy and Prywes (the SSP algorithm for short) [SSP85]. The algorithm described in [CM07] is based on an enumeration algorithm presented by Mazurkiewicz in a different model [Maz97] where each computation step involves some synchronization between adjacent processes.…”

Section: A General Algorithmmentioning

confidence: 99%

“…In this case, all kinds of terminations are equivalent: what can be computed with implicit termination can be computed with global termination detection. In the literature, one can found different algorithms to detect global termination provided that there exists a leader [DS80], that processes have unique ids [Mat87], or that processes know a bound on the diameter of the network [SSP85]. A characterization of tasks computable with global termination detection is presented in [CGMT07].…”

Section: Introductionmentioning

confidence: 99%

Local Terminations and Distributed Computability in Anonymous Networks

Chalopin

Godard

Métivier

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study weak local termination, that is when a node knows its final value but continues to execute the distributed algorithm, usually in order to provide information to other nodes. We give the first characterization of distributed tasks that can be computed with weak local termination and we present a new characterization of tasks computed with local termination. For both terminations, we also characterize tasks computable by polynomial algorithms.

show abstract

Synchronized Distributed Termination

Cited by 24 publications

References 6 publications

Election in partially anonymous networks with arbitrary knowledge in message passing systems

Election in partially anonymous networks with arbitrary knowledge in message passing systems

Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks

Local Terminations and Distributed Computability in Anonymous Networks

Contact Info

Product

Resources

About