Distributed enumeration

Mazurkiewicz, Antoni

doi:10.1016/s0020-0190(97)00022-7

Cited by 47 publications

(88 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also establish constructively the sufficiency of this condition. We use techniques inspired by the work of Mazurkiewicz [20] in a model described below (Sect. 1.4) these techniques have been already used to improve some results in an asynchronous message passing system [8] and seem complementary to techniques based on views.…”

Section: Overview Of Our Resultsmentioning

confidence: 99%

On the power of synchronization between two adjacent processes

Chalopin

Métivier

2010

Distrib. Comput.

View full text Add to dashboard Cite

We study the power of local computations on labelled edges (which allow two adjacent vertices to synchronize and to modify their states simultaneaously in function of their previous states) through the classical election problem. We characterize the graphs for which this problem has a solution. As corollaries we characterize graphs which admit an election algorithm for two seminal models: Angluin's model and asynchronous systems where processes communicate with synchronous message passing (i.e., there is a synchronization between the process sending the message and the one receiving it).

show abstract

Section: Overview Of Our Resultsmentioning

confidence: 99%

On the power of synchronization between two adjacent processes

Chalopin

Métivier

2010

Distrib. Comput.

View full text Add to dashboard Cite

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. The SSP algorithm enables to detect the global termination of an algorithm with local termination provided the processes know a bound on the diameter of the graph.…”

Section: A General Algorithmmentioning

confidence: 99%

“…As in Mazurkiewicz's algorithm [Maz97], the nice properties of the algorithm rely on a total order on local views, i.e., on finite subsets of…”

Section: A General Algorithmmentioning

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

“…An important goal in the study of these models is to understand some relationships between them. This paper is a contribution to this goal; more precisely we establish a bridge between tools and results presented in [YK96] for the message passing model and tools and results presented in [Ang80,BCG + 96, Maz97,CM04,CMZ04,Cha05] for the local computation model.…”

Section: Introductionmentioning

confidence: 99%

“…In [Maz97] Mazurkiewicz presents a distributed enumeration algorithm for non-ambiguous graphs (see also [GMM04]). The computation model in [Maz97] allows relabelling of all vertices in balls of radius 1. In the following we adapt Mazurkiewicz algorithm to graphs with port numbering and using Inst as set of basic instructions.…”

mentioning

confidence: 99%