Filters








2,473 Hits in 5.5 sec

A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring [chapter]

Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
Lecture Notes in Computer Science  
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented, among others, an algorithm with three states for the problem of mutual exclusion on a ring of processors.  ...  In this work we present a new three state self-stabilizing algorithm for mutual exclusion, with a tight bound of 5 6 n 2 + O(n) for the worst case complexity, which is the number of moves of the algorithm  ...  self-stabilizing algorithm for mutual exclusion for a ring of processors, and showed a tight bound of 5 6 n 2 + O(n) for its time complexity.  ... 
doi:10.1007/978-3-540-87779-0_5 fatcat:wxtb7gdcy5fhhajbfcmhwvjsjy

Self-stabilizing group communication in directed networks

Shlomi Dolev, Elad Schiller
2004 Acta Informatica  
Self-stabilizing algorithms for directed networks have been addressed in [2, 1, 5, 4, 14] . Self-stabilizing mutual exclusion on directed graphs was considered in [2] .  ...  A randomized self-stabilizing mutual exclusion algorithm in a uniform (directed) networks is presented in [4] .  ...  Fig. 1 . 1 A lower bound for the length of a ring Tight Lower Bound for the Length of the Virtual Ring: Fig. 2 . 2 Global constants:V : upper bound on the number of view identifiers that can be concurrently  ... 
doi:10.1007/s00236-004-0143-1 fatcat:kdv66wyh6jhyfp5v6sszrh5prq

On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms

Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
2010 Distributed computing  
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of n processors.  ...  We also present a new-three state self-stabilizing algorithm for mutual exclusion and show a tight bound of 5 6 n 2 + O(n) for the worst case complexity of this algorithm.  ...  We also presented a new three state self-stabilizing algorithm for mutual exclusion for a ring of processors and showed a tight bound of 5 6 n 2 + O(n) for its worst case time complexity.  ... 
doi:10.1007/s00446-010-0104-6 fatcat:f4mhdpmtcvggfh2qdwndodcgoe

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks [chapter]

Volker Turau, Christoph Weyer
2006 Lecture Notes in Computer Science  
The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity.  ...  This paper proposes problem-independent transformations for algorithms that stabilize under the central daemon scheduler such that they meet the demands of a WSN.  ...  In most cases the core of the transformations is a self-stabilizing local mutual exclusion algorithm based on unique node identifiers [19] .  ... 
doi:10.1007/11822035_8 fatcat:lo3ytmuiwbeilekztm23mcdcua

Acyclic Strategy for Silent Self-stabilization in Spanning Forests [chapter]

Karine Altisen, Stéphane Devismes, Anaïs Durand
2018 Lecture Notes in Computer Science  
We show that any algorithm of this class is (1) silent and self-stabilizing under the distributed unfair daemon, and (2) has a stabilization time polynomial in moves and asymptotically optimal in rounds  ...  Precisely, we study a class of algorithms devoted to networks endowed with a sense of direction describing a spanning forest whose characterization is a simple (i.e., quasi-syntactic) condition.  ...  The aim is to show that: (1) correctness and move complexity of T E can be easily deduced from our general results, (2) our upper bound on stabilization time in moves is tight for this example, and (3)  ... 
doi:10.1007/978-3-030-03232-6_13 fatcat:qruhqthmvbhvflxi3wegswl7de

ACM SIGACT news distributed computing column 32

Idit Keidar
2008 ACM SIGACT News  
Thanks to Cyril Gavoille, Phuong Hoai Ha, David Ilcinkas, Hyonho Lee, Yee Jiun Song, Gadi Taubenfeld, and Shmuel Zaks for sharing their excellent photos.  ...  The first paper, "A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring" by Chernoy et al., presents a three-state mutual exclusion algorithm for ring networks and a tight bound  ...  The best paper award was given to Robert Danek and Wojciech Golab for "Closing the Complexity Gap Between FCFS Mutual Exclusion and Mutual Exclusion", which presented the first known FCFS Mutual Exclusion  ... 
doi:10.1145/1466390.1466402 fatcat:ygqihi4p5vfnfnmzufwi2fnyk4

Self-Stabilizing Repeated Balls-into-Bins [article]

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
2016 arXiv   pre-print
This implies that the process is self-stabilizing and that every ball traverses all bins in O(n ^2 n) rounds, w.h.p.  ...  We prove that, starting from any configuration, the process will converge to a legitimate configuration in linear time and then it will only take on legitimate configurations over a period of length bounded  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
arXiv:1501.04822v3 fatcat:7wuz2jbnz5eupi64hn5jrttpxi

Self-Stabilizing Repeated Balls-into-Bins

LucaBecchetti Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
2015 Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '15  
This process corresponds to a non-reversible Markov chain and our aim is to study its self-stabilization properties with respect to the maximum (bin) load and some related performance measures.  ...  Then, in every subsequent round, one ball is chosen according to some fixed strategy (random, FIFO, etc) from each non-empty bin, and re-assigned to one of the n bins uniformly at random.  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
doi:10.1145/2755573.2755584 dblp:conf/spaa/BecchettiCNPP15 fatcat:tq2atreyovcuvlzybcwnq2vmne

A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm [chapter]

Yuan Feng, Lijun Zhang
2014 Lecture Notes in Computer Science  
We present an elementary proof showing a bound of 0.167N 2 , a sharp improvement compared with the best known bound 0.521N 2 .  ...  In this paper we consider Herman's self-stabilization algorithm and study its expected self-stabilization time.  ...  On the other side, Herman proposed a randomized program in [7] to break the symmetry: he proposed a self-stabilizing mutual exclusion algorithm, today known as Herman's algorithm, which stabilizes within  ... 
doi:10.1007/978-3-662-44584-6_24 fatcat:nodnbzzcmrhqvkm6455n7sghne

A nearly optimal upper bound for the self-stabilization time in Herman's algorithm

Yuan Feng, Lijun Zhang
2015 Distributed computing  
We present an elementary proof showing a bound of 0.167N 2 , a sharp improvement compared with the best known bound 0.521N 2 .  ...  In this paper we consider Herman's self-stabilization algorithm and study its expected self-stabilization time.  ...  On the other side, Herman proposed a randomized program in [7] to break the symmetry: he proposed a self-stabilizing mutual exclusion algorithm, today known as Herman's algorithm, which stabilizes within  ... 
doi:10.1007/s00446-015-0241-z fatcat:j4z2w7pofbflrdjdnxfiivoyg4

Time-adaptive self stabilization

Shay Kutten, Boaz Patt-Shamir
1997 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97  
We describe time adaptive protocols, and upper and lower bound for their stabilization time, and their fault resilience.  ...  stabilization), and the additional desirable properties for such protocols.  ...  Finally, we combine the synchronizer pulses with the regulated broadcast ticks. 6 Reactive Tasks: the Case of Mutual Exclusion In this problem it is required that exactly one node "possesses the token  ... 
doi:10.1145/259380.259435 dblp:conf/podc/KuttenP97 fatcat:atoyjcon4zei3ff3hapdrgm34y

Efficient token-based control in rings

Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
1996 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96  
In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities.  ...  We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this amount is unbounded for classical solutions.  ...  In fact, within the context of distributed computing, the research has mostly focused on detection of token loss [10, 11] and on self-stabilization aspects (e.g., [4, 6, 8, 9] ).  ... 
doi:10.1145/248052.248080 dblp:conf/podc/FeuersteinLMS96 fatcat:tf6zaxfdxndfnpu66catqcemja

Efficient token-based control in rings

Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro
1998 Information Processing Letters  
In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities.  ...  We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this amount is unbounded for classical solutions.  ...  In fact, within the context of distributed computing, the research has mostly focused on detection of token loss [10, 11] and on self-stabilization aspects (e.g., [4, 6, 8, 9] ).  ... 
doi:10.1016/s0020-0190(98)00054-4 fatcat:rsawdnz35jdw5dpzz3g66bxld4

Self-stabilizing repeated balls-into-bins

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, G. Posta
2017 Distributed computing  
This process corresponds to a non-reversible Markov chain and our aim is to study its self-stabilization properties with respect to the maximum (bin) load and some related performance measures.  ...  Then, in every subsequent round, one ball is chosen according to some fixed strategy (random, FIFO, etc) from each non-empty bin, and re-assigned to one of the n bins uniformly at random.  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
doi:10.1007/s00446-017-0320-4 fatcat:3db3zbpmunen3ivllreulgxwyy

The local detection paradigm and its applications to self-stabilization

Yehuda Afek, Shay Kutten, Moti Yung
1997 Theoretical Computer Science  
A new paradigm for the design of self-stabilizing distributed algorithms, called local drtrction, is introduced.  ...  These algorithms provide for the easy construction of self-stabilizing protocols fcr numerous tasks: reset, routing, topology-update and self-stabilization transformers that automatically self-stabilize  ...  Acknowledgements We would like to thank Shlomi Dolev, Amos Israeli and Shlomo Moran for useful discussions and the anonymous referees for very thorough and helpful reviews.  ... 
doi:10.1016/s0304-3975(96)00286-1 fatcat:tnauj7blgbflrbtm26nkkkmoy4
« Previous Showing results 1 — 15 out of 2,473 results