Light enabling snap-stabilization of fundamental protocols

Cournier, Alain; Devismes, Stéphane; Villain, Vincent

doi:10.1145/1462187.1462193

Cited by 33 publications

(35 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To obtain such a token circulation, one can compose a selfstabilizing leader election algorithm (e.g., in [1], [13], [15]) with one of the self-stabilizing token circulation algorithms in [9], [10], [12], [17] for arbitrary rooted networks. The composition only consists of two algorithms running concurrently with the following rule: if a process decides that it is the leader, it executes the root code of the token circulation.…”

Section: Propertymentioning

confidence: 99%

“…We assume that T C is a fair composition of the token circulation algorithm in [10] and the leader election algorithm in [13]. It follows that the following properties hold: (1) starting from any configuration, there is a unique token in the distributed system in O(n) rounds, and (2) once there is a unique token, O(n) processes can receive the token before a process receives the token.…”

Section: Inputsmentioning

confidence: 99%

See 1 more Smart Citation

Snap-Stabilizing Committee Coordination

Bonakdarpour

Devismes

Petit

2011

2011 IEEE International Parallel &Amp; Distributed Processing Symposium

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper, we propose two snap-stabilizing distributed algorithms for the committee coordination problem. In this problem, any committee consists of a set of processes and committee meetings are synchronized, so that each process participates in at most one committee meeting at any time. Snap-stabilization is a versatile technique allowing to design algorithms that efficiently tolerate transient faults. Indeed, after a finite number of such faults (e.g. memory corruptions, message losses, etc), a snap-stabilizing algorithm immediately operates correctly, without any external intervention.We design snap-stabilizing committee coordination algorithms enriched with some desirable properties related to concurrency, (weak) fairness, and a stronger synchronization mechanism called 2-Phase Discussion Time. From previous papers, we know that (1) in the general case, (weak) fairness cannot be achieved in the committee coordination, (2) however, it becomes feasible provided that each process waits for meetings infinitely often. Nevertheless, we show that even under this latter assumption, it is impossible to implement a fair solution that allows the best level of concurrency, so called the maximal concurrency. Hence, we propose two orthogonal snapstabilizing algorithms each satisfying, 2-phase discussion time, and either maximal concurrency or fairness. The algorithm implementing fairness requires that every process waits for meetings infinitely often. Moreover, for this algorithm, we introduce and evaluate a new efficiency criterion called the degree of fair concurrency. This criterion shows that even if it does not satisfy maximal concurrency, our snap-stabilizing fair algorithm still allows a high level of concurrency.

show abstract

Section: Propertymentioning

confidence: 99%

Section: Inputsmentioning

confidence: 99%

Snap-Stabilizing Committee Coordination

Bonakdarpour

Devismes

Petit

2011

2011 IEEE International Parallel &Amp; Distributed Processing Symposium

Self Cite

View full text Add to dashboard Cite

show abstract

“…The second definition of snap-stabilization describes a snapstabilizing program as immediately satisfying an external invocation (such as waves in [6], [7], [8]). Such approach may lead to specifications with sequence-based safety and liveness properties.…”

Section: Related Workmentioning

confidence: 99%

Ideal Stabilization

Nesterenko

Tixeuil²

2011

2011 IEEE International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

International audienceWe define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with arbitrary degree of precision not only the fault-free program behavior but also its recovery operation. Specifications may or may not mention all possible states. We identify approaches to designing ideal stabilization to both kinds of specifications. For the first kind, we state the necessary condition for an ideally stabilizing solution. On the basis of this condition we prove that there is no ideally stabilizing solution to the leader election problem. We illustrate the utility of the concept by providing examples of well-known programs and proving them ideally stabilizing. Specifically, we prove ideal stabilization of the conflict manager, the alternator, the propagation of information with feedback and the alternating bit protocol

show abstract

“…Generally, this resource corresponds to a set of shared variables in a common store or a shared hardware device (e.g., a printer). The first snap-stabilizing implementation of mutual exclusion is presented in [21] but in the state model (a stronger model than the message-passing model). In [21], authors adopt the following specification 4 :…”

Section: A Mutual Exclusion Protocolmentioning

confidence: 99%

Snap-Stabilization in Message-Passing Systems

Delaët

Devismes

Nesterenko

et al. 2008

Distributed Computing and Networking

View full text Add to dashboard Cite

In this paper, we tackle the open problem of snap-stabilization in messagepassing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilization guarantees that the effect of faults is contained immediately after faults cease to occur. Our contribution is twofold: we show that (1) snap-stabilization is impossible for a wide class of problems if we consider networks with finite yet unbounded channel capacity; (2) snapstabilization becomes possible in the same setting if we assume bounded-capacity channels. We propose three snap-stabilizing protocols working in fully-connected networks. Our work opens exciting new research perspectives, as it enables the snap-stabilizing paradigm to be implemented in actual networks. Stabilisation instantanée dans les systèmesà passage de messagesRésumé : Dans cet article, nous considérons le problème, jusqu'ici ouvert, de la stabilisation instantanée dans les systèmesà passage de messages. La stabilisation instantanée est une approcheélégante permettant de réaliser des protocoles qui supportent les fautes transitoires. Par rapportà l'approche auto-stabilisante, la stabilisation instantanément stabilisante assure que l'effet des fautes est contenu immédiatement après que celles-ci cessent. Notre contribution est double: nous prouvons que (1) la stabilisation instantanée est impossible pour de nombreux problèmes si nous supposons des réseaux où la capacité des canaux de communications est finie mais non bornée; (2) la stabilisation instantanée devient possible avec les mêmes paramètres si on suppose que la capacité des canaux est bornée. A titre d'exemple, Nous proposons trois protocoles instantanément stabilisants fonctionnant dans un réseau complet. Ces travaux ouvrent de nouvelles perspectives de recherche car ils démontrent que la stabilisation instantanée peutêtre implantée dans les réseaux actuels.

show abstract

Light enabling snap-stabilization of fundamental protocols

Cited by 33 publications

References 20 publications

Snap-Stabilizing Committee Coordination

Snap-Stabilizing Committee Coordination

Ideal Stabilization

Snap-Stabilization in Message-Passing Systems

Contact Info

Product

Resources

About