Filters








75,338 Hits in 4.2 sec

Self-stabilizing extensions for message-passing systems

Shmuel Katz, Kenneth Perry
1990 Proceedings of the ninth annual ACM symposium on Principles of distributed computing - PODC '90  
The computational model used is that of an asynchronous distributed message-passing system whose communication topology is an arbitrary graph.  ...  Self-stabilization is an abstraction of fault tolerance for transient malfunctions.  ...  a self-stabilizing extension. 5 Automatically creating selfstabilizing extensions In this section, we give a means for automatically creating a self-stabilizing extension of a distributed program P.  ... 
doi:10.1145/93385.93405 dblp:conf/podc/KatzP90 fatcat:336dxaz4kraotfzcd57weynt24

Self-Stabilizing Indulgent Zero-degrading Binary Consensus [article]

Oskar Lundström and Michel Raynal and Elad Michael Schiller
2020 arXiv   pre-print
This work proposes the first, to the best of our knowledge, self-stabilizing algorithm for indulgent zero-degrading binary consensus for time-free message-passing systems prone to detectable process failures  ...  We do so through the lenses of self-stabilization - a very strong notion of fault-tolerance.  ...  Conclusions We showed how a non-self-stabilizing algorithm for indulgent zero-degrading binary consensus by Guerraoui and Raynal [25] can be transformed into one that can recover after the occurrence  ... 
arXiv:2010.05489v1 fatcat:jyjr2hvx65bahclzf3zwywjqhm

Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems [article]

Chryssis Georgiou and Ioannis Marcoullis and Michel Raynal and Elad Michael Schiller
2021 arXiv   pre-print
The proposed algorithm is the first loosely-self-stabilizing Byzantine fault-tolerant binary consensus algorithm suited to asynchronous message-passing systems.  ...  The present article presents a non-trivial extension of MMR to an even more fault-prone context, namely, in addition to Byzantine processes, it considers also that the system can experience transient failures  ...  Self-stabilizing non-Byzantine fault-tolerant solutions Lundström, Raynal, and Schiller [61] presented the first self-stabilizing solution for the problem of binary consensus for message-passing systems  ... 
arXiv:2103.14649v2 fatcat:45yefo4lrzdihdw4eseue5mjfu

Page 8273 of Mathematical Reviews Vol. , Issue 2001K [page]

2001 Mathematical Reviews  
“This paper proposes the first self-stabilizing depth-first token circulation algorithm for message-passing systems.  ...  in asynchronous message-passing systems.  ... 

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  ...  A New Transformation of Self-Stabilizing Algorithms from Message Passing to Shared Memory In this section, we propose a transformation of self-stabilizing algorithms from the message passing model to the  ... 
doi:10.1007/3-540-36108-1_7 fatcat:jc5o2f2g2ve4tl2qjo27vgmjoy

Snap-Stabilization in Message-Passing Systems [chapter]

Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil
2008 Lecture Notes in Computer Science  
In this paper, we tackle the problem of snap-stabilization in message-passing systems.  ...  Our contribution is twofold: we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if channels are of finite yet unbounded capacity, and (ii) snap-stabilization  ...  Related works Several papers investigate the possibility of self-stabilization in message passing systems [9] [10] [11] [12] [13] [14] [15] [16] [17] .  ... 
doi:10.1007/978-3-540-92295-7_34 fatcat:6atsinc4gfelbgimprqwij7dvq

Snap-stabilization in message-passing systems

Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil
2008 Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC '08  
In this paper, we tackle the problem of snap-stabilization in message-passing systems.  ...  Our contribution is twofold: we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if channels are of finite yet unbounded capacity, and (ii) snap-stabilization  ...  Related works Several papers investigate the possibility of self-stabilization in message passing systems [9] [10] [11] [12] [13] [14] [15] [16] [17] .  ... 
doi:10.1145/1400751.1400838 dblp:conf/podc/DelaetDNT08 fatcat:soetwxewrrenzpzpnrhost2xeu

Snap-stabilization in message-passing systems

Sylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil
2010 Journal of Parallel and Distributed Computing  
In this paper, we tackle the problem of snap-stabilization in message-passing systems.  ...  Our contribution is twofold: we demonstrate that in message passing systems (i) snap-stabilization is impossible for nontrivial problems if channels are of finite yet unbounded capacity, and (ii) snap-stabilization  ...  Related works Several papers investigate the possibility of self-stabilization in message passing systems [9] [10] [11] [12] [13] [14] [15] [16] [17] .  ... 
doi:10.1016/j.jpdc.2010.04.002 fatcat:l22evf6rezdstmfmynanhctxja

Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding [chapter]

Vijay K. Garg, Anurag Agarwal
2005 Lecture Notes in Computer Science  
In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology.  ...  Our algorithm also stabilizes faster than the previous approaches.  ...  Our algorithm is designed for asynchronous message-passing systems, and does not require a central daemon [8] for scheduling decisions.  ... 
doi:10.1007/11549468_68 fatcat:ycff7kybvvazhjlbb4uxykcs34

Stabilizing data-link over non-FIFO channels with optimal fault-resilience

Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil
2011 Information Processing Letters  
This paper is the first to lay the bases for the design of self-stabilizing message passing algorithms over unreliable non-FIFO channels.  ...  Asynchronous message passing is a more realistic way, compared to the state model, for the communication of processes in distributed systems.  ...  The token passing protocol in [8] can be used as a self-stabilizing ABP on bounded channels and only uses bounded memory. Howell et al.  ... 
doi:10.1016/j.ipl.2011.06.010 fatcat:sqxie5ku2ngfrgk54mit5vuh64

Self-stabilizing Uniform Reliable Broadcast [article]

Oskar Lundström and Michel Raynal and Elad M. Schiller
2020 arXiv   pre-print
This work proposes the first self-stabilizing URB solution for time-free message-passing systems that are prone to node-failures.  ...  Our study focuses on fault-tolerant implementations for time-free message-passing systems that are prone to node-failures.  ...  This requires non-trivial considerations that are imperative for self-stabilizing systems, such as the explicit use of bounded buffers.  ... 
arXiv:2001.03244v1 fatcat:zafvw2usdrhyhg3nzemaojseyi

Self-stabilizing Byzantine-tolerant Broadcast [article]

Romaric Duvignau and Michel Raynal and Elad Michael Schiller
2022 arXiv   pre-print
We propose, to the best of our knowledge, the first self-stabilizing Byzantine-tolerant BRB solution for signature-free message-passing systems.  ...  Our study focuses on fault-tolerant implementations for message-passing systems that are prone to process-failures, such as crashes and malicious behavior.  ...  Self-stabilizing IRC for Time-free Message-passing Systems Algorithm 3 presents a non-crash-tolerant self-stabilizing solution for message-passing systems.  ... 
arXiv:2201.12880v1 fatcat:nxocwjduqzf4fakrwmq754ykce

Corona: A Stabilizing Deterministic Message-Passing Skip List [chapter]

Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler
2011 Lecture Notes in Computer Science  
We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed.  ...  Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well.  ...  In this paper we present Corona: a self-stabilizing deterministic skip list construction algorithm in message-passing systems. To the best of our knowledge Corona is the first such algorithm.  ... 
doi:10.1007/978-3-642-24550-3_27 fatcat:lfgsb7eourhh7f6md2rlcwr6wu

Self-stabilizing K-out-of-L exclusion on tree network [article]

Ajoy K. Datta, Florian Horn
2009 arXiv   pre-print
We propose the first deterministic self-stabilizing distributed K-out-of-L exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each  ...  This is exacerbated by the difficulty of obtaining self-stabilizing solutions in message-passing system (the more realistic model), as underlined by the impossibility result of Gouda and Multari [7] .  ...  self-stabilization.  ... 
arXiv:0812.1093v4 fatcat:g4rlalipgzbkjaq3ujs5zsrp3u

Corona: A stabilizing deterministic message-passing skip list

Rizal Mohd Nor, Mikhail Nesterenko, Christian Scheideler
2013 Theoretical Computer Science  
We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed.  ...  Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well.  ...  In this paper we present Corona: a self-stabilizing deterministic skip list construction algorithm in message-passing systems. To the best of our knowledge Corona is the first such algorithm.  ... 
doi:10.1016/j.tcs.2012.08.029 fatcat:ez776kuhdrenvetbamhnvhiopi
« Previous Showing results 1 — 15 out of 75,338 results