Filters








1,460 Hits in 2.2 sec

Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks

Samuel Bernard, Stephane Devismes, Maria Gradinariu Potop-Butucaru, Sebastien Tixeuil
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates.  ...  A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without external  ...  A possible execution with synchronous scheduling Algorithm 1 A 1 uniform deterministic vertex coloring algorithm for unidirectional rings process i const k : integer p.i : predecessor of i var c.i :  ... 
doi:10.1109/ipdps.2009.5161053 dblp:conf/ipps/BernardDPT09 fatcat:6v5vrjop6ncqnd6rbtmqfktwcm

SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE

WAYNE GODDARD, PRADIP K. SRIMANI
2012 International Journal of Foundations of Computer Science  
Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ...  Recently, Lee et al. obtained such an algorithm for determining the size of a unidirectional ring. We provide a new algorithm that converges much quicker.  ...  Introduction Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ... 
doi:10.1142/s0129054112400357 fatcat:jimo46tzevaopdynqlxb3sfd3y

Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size

Wayne Goddard, Pradip K Srimani
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ...  Recently, Lee et al. obtained such an algorithm for determining the size of a unidirectional ring. We provide a new algorithm that converges much quicker.  ...  Introduction Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ... 
doi:10.1109/ipdpsw.2010.5470841 dblp:conf/ipps/GoddardS10 fatcat:o63omia5obeoxk2atepug3cfdy

An exercise in fault-containment: Self-stabilizing leader election

Sukumar Ghosh, Arobinda Gupta
1996 Information Processing Letters  
The technique for transforming a self-stabilizing algorithm into its fault-contained version is simple and general, and can be applied to other problems as well that satisfy certain properties.  ...  As an illustration, we present a simple self-stabilizing leader election protocol that recovers in 0( 1) time from a state with a single transient fault on oriented rings, Only the faulty node and its  ...  Acknowledgements We thank the anonymous referees for many helpful suggestions that greatly improved the presentation of this paper. We also acknowledge many helpful discussions with Sriram V.  ... 
doi:10.1016/0020-0190(96)00121-4 fatcat:vshbwjw7nzbihbosiuj4df65xq

Leader Election in Anonymous Rings: Franklin Goes Probabilistic [chapter]

Rena Bakhshi, Wan Fokkink, Jun Pang, Jaco van de Pol
2008 IFIP International Federation for Information Processing  
We also sketch a formal correctness proof of the algorithm for rings with arbitrary size.  ...  We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings.  ...  Acknowledgement We thank Bert Lisser for performing the experiments on the distributed version of the µCRL toolset.  ... 
doi:10.1007/978-0-387-09680-3_4 fatcat:ejpwlbgvzbhntgq3f7gfqoihty

Self-stabilizing token circulation on asynchronous uniform unidirectional rings

Laurent Rosaz
2000 Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00  
Johnen presented a probabilistic self-stabilizing token circulation algorithm for asynchronous uniform unidirectional rings. This paper provides an improvement on this algorithm.  ...  Such algorithms are mostly used for mutual exclusion.  ...  Such algorithms self-stabilize to the circulation of a single P-token if the ring is synchronous (generalization of [10] ) or the daemon is k-bounded [1] .  ... 
doi:10.1145/343477.343626 dblp:conf/podc/Rosaz00 fatcat:cqkffmpxn5a6jinkt7lw562y74

Brief Announcement: Self-stabilizing Synchronization of Arbitrary Digraphs in Presence of Faults [chapter]

Mahyar R. Malekpour
2012 Lecture Notes in Computer Science  
Introduction This brief announcement presents a fault-tolerant self-stabilizing distributed clock synchronization protocol for an arbitrary, non-partitioned digraph.  ...  There exist many clock synchronization algorithms for special cases and restricted conditions.  ... 
doi:10.1007/978-3-642-33536-5_4 fatcat:54fw2kpwvjhiflmjegje5mj3sy

Self-stabilization

Marco Schneider
1993 ACM Computing Surveys  
of compilers with respect to self-stabilization, and some of the factors that prevent self-stabilization.  ...  self-stabilizing algorithm for a synchronous ring with an odd number of identical processes and one token. 3.4 Reducing States in a Token Ring In this section we discuss results concerning  ...  Gouda and Herman [1990] provide a self- stabilizing algorithm for synchronous unison with unbounded counters.  ... 
doi:10.1145/151254.151256 fatcat:q4iaflmmgnafpbgdhuyzke2p6y

Bounds for self-stabilization in unidirectional networks [article]

Samuel Bernard, Maria Gradinariu Potop-Butucaru
2008 arXiv   pre-print
Unidirectional networks preclude many common techniques in self-stabilization from being used, such as preserving local predicates.  ...  In this paper, we investigate the intrinsic complexity of achieving self-stabilization in unidirectional networks, and focus on the classical vertex coloring problem.  ...  Since a self-stabilizing algorithm may start from any arbitrary state, lower bounds for non-stabilizing (a.k.a. properly initialized) distributed algorithms still hold for self-stabilizing ones.  ... 
arXiv:0805.0851v2 fatcat:3eywmu65qnfw5imkyiwohnznta

On Stabilization in Herman's Algorithm [chapter]

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang
2011 Lecture Notes in Computer Science  
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes.  ...  It is straightforward that the algorithm achieves stabilization almost surely from any initial configuration, and it is known that the worst-case expected time to stabilization (with respect to the initial  ...  Only one of those algorithms works in a unidirectional ring, the other algorithms need more connections.  ... 
doi:10.1007/978-3-642-22012-8_37 fatcat:as2mqkfjozactknyslm7j4eodi

Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size

Wayne Goddard, Pradip K. Srimani
2011 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum  
Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ...  We consider the model introduced by Lee et al. where there is one designated master node and all other nodes are anonymous and as simple as possible, We provide here a master-slave algorithm that achieves  ...  Introduction Self-stabilizing algorithms represent an extension of distributed algorithms in which nodes of the network have neither coordination, synchronization, nor initialization.  ... 
doi:10.1109/ipdps.2011.200 dblp:conf/ipps/GoddardS11 fatcat:t46xsewbyrgwxl7i5tqiyzgkum

Weak vs. Self vs. Probabilistic Stabilization

Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
2008 2008 The 28th International Conference on Distributed Computing Systems  
Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one  ...  This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) selfstabilizing counterparts.  ...  We now show that, contrary to deterministic self-stabilization, deterministic weakstabilizing token circulation under distributed strongly fair scheduler exists in an anonymous unidirectional ring.  ... 
doi:10.1109/icdcs.2008.12 dblp:conf/icdcs/DevismesTY08 fatcat:3h3ck6as5ngkxlltfbeiubzy3e

Weak vs. Self vs. Probabilistic Stabilization

Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
2015 International Journal of Foundations of Computer Science  
Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one  ...  This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) selfstabilizing counterparts.  ...  We now show that, contrary to deterministic self-stabilization, deterministic weakstabilizing token circulation under distributed strongly fair scheduler exists in an anonymous unidirectional ring.  ... 
doi:10.1142/s0129054115500173 fatcat:hmdw7hcvvrcc3deytjujbrof5a

Automated Synthesis of Distributed Self-Stabilizing Protocols [article]

Fathiyeh Faghih, Borzoo Bonakdarpour, Sebastien Tixeuil, Sandeep Kulkarni
2017 arXiv   pre-print
Our proposed methods are fully implemented and we report successful synthesis of well-known protocols such as Dijkstra's token ring, a self-stabilizing version of Raymond's mutual exclusion algorithm,  ...  In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology.  ...  A Grundy coloring for a graph is one in which every node is a Grundy node. Table 6 : Results for monotonic stabilizing maximal independent set in unidirectional ring.  ... 
arXiv:1509.05664v3 fatcat:6abyax5qvvdunp6oykp2wblwde

Separation of circulating tokens

K. GhoshDastidar, T. Herman
2011 Theoretical Computer Science  
Self-stabilizing distributed control is often modeled by token abstractions.  ...  This problem is first considered in a ring where d is given whilst m and the ring size n are unknown.  ...  self-stabilizing token protocols as a basis for our work.  ... 
doi:10.1016/j.tcs.2010.09.013 fatcat:x7pdciq5graf3byy4notco52pi
« Previous Showing results 1 — 15 out of 1,460 results