Filters








231 Hits in 4.6 sec

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.  ...  Our Contribution In this work we present an analysis of the worst case performance of two known self-stabilizing algorithms for mutual exclusion for a ring of processors: Dijkstra's third algorithm, and  ... 
doi:10.1007/s00446-010-0104-6 fatcat:f4mhdpmtcvggfh2qdwndodcgoe

Specification-Based Synthesis of Distributed Self-Stabilizing Protocols [chapter]

Fathiyeh Faghih, Borzoo Bonakdarpour, Sébastien Tixeuil, Sandeep Kulkarni
2016 Lecture Notes in Computer Science  
Our proposed methods are implemented and we report successful synthesis of Dijkstra's token ring and a self-stabilizing version of Raymond's mutual exclusion algorithm, as well as ideal-stabilizing leader  ...  election and local mutual exclusion.  ...  Acknowledgments This research was supported in part by Canada NSERC Discovery Grant 418396-2012 and NSERC Strategic Grant 430575-2012.  ... 
doi:10.1007/978-3-319-39570-8_9 fatcat:sfg74obhjbhj7hxydfee6rwbaa

Symbolic model checking for self-stabilizing algorithms

T. Tsuchiya, S. Nagano, R.B. Paidi, T. Kikuno
2001 IEEE Transactions on Parallel and Distributed Systems  
So far applying model checking to self-stabilizing algorithms has not been successful due to the problem of state explosion.  ...  In this paper we present our results of using symbolic model checking to verify distributed algorithms against the self-stabilizing property.  ...  The authors also thank the anonymous referees for their helpful suggestions on how to improve this paper.  ... 
doi:10.1109/71.899941 fatcat:fypp5fxefvcbpiigediwenrnqi

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,  ...  ideal-stabilizing leader election and local mutual exclusion, as well as monotonic-stabilizing maximal independent set and distributed Grundy coloring.  ...  We would also like to acknowledge the anonymous referees who carefully reviewed the article and provided us with many constructive comments.  ... 
arXiv:1509.05664v3 fatcat:6abyax5qvvdunp6oykp2wblwde

Benefit of Self-Stabilizing Protocols in Eventually Consistent Key-Value Stores: A Case Study [article]

Duong Nguyen, Sandeep S. Kulkarni, Ajoy K. Datta
2018 arXiv   pre-print
In this paper, we focus on the implementation of distributed programs in using a key-value store where the state of the nodes is stored in a replicated and partitioned data store to improve performance  ...  if there is just one copy of the data.  ...  In this paper, we evaluate whether using a self-stabilizing algorithm can permit us to use the third option in terms of providing desirable program behavior as well as in terms of performance.  ... 
arXiv:1808.00822v2 fatcat:3okxywxtsvdo7fcw5eznved5zy

Shared-memory mutual exclusion: major research trends since 1986

James H. Anderson, Yong-Jik Kim, Ted Herman
2003 Distributed computing  
In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [70] . In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion.  ...  In work on fast mutual exclusion algorithms, time complexity in the absence of contention is the primary concern.  ...  To say that all research on shared-memory mutual exclusion algorithms conducted over the last seventeen years fits within the categories noted above would be incorrect.  ... 
doi:10.1007/s00446-003-0088-6 fatcat:g57iqdjp5neu7eu6sm5hpamohi

Introducing middle school girls to fault tolerant computing

Paolo A. G. Sivilotti, Murat Demirbas
2003 ACM SIGCSE Bulletin  
Our aim was ambitious: to introduce these students, ages 12 and 13, to computer science by focussing on the deep intellectual topic of self-stabilizing distributed algorithms and by imparting an intuitive  ...  This paper describes the sequence of exercises we developed as an elementary-level introduction to the graduate-level topics of fault tolerance and self-stabilization.  ...  This activity involved two algorithms for token-based mutual exclusion in a ring. The first was brittle, while the second was self-stabilizing.  ... 
doi:10.1145/792548.611999 fatcat:nwo32myw3fgfdjcmpeizqogere

Introducing middle school girls to fault tolerant computing

Paolo A. G. Sivilotti, Murat Demirbas
2003 Proceedings of the 34th SIGCSE technical symposium on Computer science education - SIGCSE '03  
Our aim was ambitious: to introduce these students, ages 12 and 13, to computer science by focussing on the deep intellectual topic of self-stabilizing distributed algorithms and by imparting an intuitive  ...  This paper describes the sequence of exercises we developed as an elementary-level introduction to the graduate-level topics of fault tolerance and self-stabilization.  ...  This activity involved two algorithms for token-based mutual exclusion in a ring. The first was brittle, while the second was self-stabilizing.  ... 
doi:10.1145/611892.611999 dblp:conf/sigcse/SivilottiD03 fatcat:jn64d7lcrnazxhaqjte4m57kjq

Introducing middle school girls to fault tolerant computing

Paolo A. G. Sivilotti, Murat Demirbas
2003 Proceedings of the 34th SIGCSE technical symposium on Computer science education - SIGCSE '03  
Our aim was ambitious: to introduce these students, ages 12 and 13, to computer science by focussing on the deep intellectual topic of self-stabilizing distributed algorithms and by imparting an intuitive  ...  This paper describes the sequence of exercises we developed as an elementary-level introduction to the graduate-level topics of fault tolerance and self-stabilization.  ...  This activity involved two algorithms for token-based mutual exclusion in a ring. The first was brittle, while the second was self-stabilizing.  ... 
doi:10.1145/611997.611999 fatcat:sjmthoobjrc2ladzyjusxq5ije

Transformations of Self-Stabilizing Algorithms [chapter]

Kleoni Ioannidou
2002 Lecture Notes in Computer Science  
For our transformation, we use a new self-stabilizing token-passing algorithm for the shared memory model. This algorithm stabilizes in O(n log 2 n) rounds, which improves existing algorithms.  ...  We present a new transformation of self-stabilizing algorithms from a message passing model to a shared memory model with a nite number of registers of bounded size and processors of bounded memory and  ...  Dolev 8] presents another transformation from Dijkstra's composite atomicity model to a read-write shared memory model using Dijkstra's self-stabilizing mutual exclusion algorithm and a self-stabilizing  ... 
doi:10.1007/3-540-36108-1_7 fatcat:jc5o2f2g2ve4tl2qjo27vgmjoy

Synthesis of a simple self-stabilizing system

Adrià Gascón, Ashish Tiwari
2014 Electronic Proceedings in Theoretical Computer Science  
By means of a classical example, we illustrate a simple template-based approach to computer-aided design of distributed systems based on leveraging the well-known technique of bounded model checking to  ...  Although the area of formal verification has made enormous advances towards this goal, the resulting functionalities are limited to detecting problems in a particular design.  ...  Running example: Reaching Mutual Exclusion In this section, we describe a simple example inspired by Dijkstra's paper [5] , which is a remarkable milestone in the study of fault tolerance.  ... 
doi:10.4204/eptcs.157.5 fatcat:s3en3zplsbcwzonrdfirg72qry

Automatic Completion of Distributed Protocols with Symmetry [chapter]

Rajeev Alur, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, Abhishek Udupa
2015 Lecture Notes in Computer Science  
For evaluation, we show that our prototype is able to automatically discover interesting missing details in distributed protocols for mutual exclusion, self stabilization, and cache coherence.  ...  Our counterexampleguided synthesis algorithm consists of repeatedly invoking two phases. In the first phase, candidates for unknown expressions are generated using the SMT solver Z3.  ...  A prototype implementation, which included a custom model checker, successfully synthesized non-trivial portions of Peterson's mutual exclusion protocol, Dijkstra's self-stabilizing system, and the German  ... 
doi:10.1007/978-3-319-21668-3_23 fatcat:7jkacxt2wbh5tazc4wfsa5jddm

A collection of kinesthetic learning activities for a course on distributed computing

Paolo A. G. Sivilotti, Scott M. Pike
2007 ACM SIGACT News  
Two templates have emerged as common themes in the design of KLAs for computer science topics: algorithms enacted by people and data structures built from people.  ...  or to review an event related to theory of distributed computing.  ...  In Dijkstra's classic self-stabilizing token ring algorithm [Dij74] , k processes are arranged in a ring and each maintains an integer in the range 0 to k − 1.  ... 
doi:10.1145/1272729.1272741 fatcat:lvrqqah4xfb3th7bo7agz4lerq

Self-stabilizing Leader Election in Dynamic Networks [chapter]

Ajoy K. Datta, Lawrence L. Larmore, Hema Piniganti
2010 Lecture Notes in Computer Science  
Note that any self-stabilizing algorithm for the leader election problem is also an algorithm for the dynamic leader election problem, since when the topology of the network changes, we can consider that  ...  In this thesis, three silent self-stabilizing asynchronous distributed algorithms are given for the leader election problem in a dynamic network with unique IDs, using the composite model of computation  ...  In Section 3.3 and 3.4 we give a brief overview of Non Self Stabilizing and Self Stabilizing algorithms in the literature that are similar to our algorithms, we also mention other related work.  ... 
doi:10.1007/978-3-642-16023-3_6 fatcat:uau4uw6drfde5p4m4ve6gmivky

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  
Such algorithms are mostly used for mutual exclusion.  ...  Gradinariu and C. Johnen presented a probabilistic self-stabilizing token circulation algorithm for asynchronous uniform unidirectional rings. This paper provides an improvement on this algorithm.  ...  A classical way to solve the mutual exclusion problem, especially on rings, is by circulating one token: a process is allowed to be in the critical section only if it holds the token.  ... 
doi:10.1145/343477.343626 dblp:conf/podc/Rosaz00 fatcat:cqkffmpxn5a6jinkt7lw562y74
« Previous Showing results 1 — 15 out of 231 results