Results 1 - 10 of 24

Probabilistic Snap-Stabilizing Algorithms for Local Resource Allocation Problems

by Anaïs Dur, Karine Altisen, Stéphane Devismes, Anaïs Dur, Karine Altisen, Stéphane Devismes, Probabilistic Snap-stabilizing, Lra Anaïs Dur, Karine Altisen, Stéphane Devismes , 2013
"... A distributed algorithm is snap-stabilizing if it enables a distributed system to resume a cor-rect behavior immediately after transient faults place it in some arbitrary state. In this paper, we propose two probabilistic snap-stabilizing algorithms to solve the local mutual exclusion problem and th ..."
Abstract - Add to MetaCart
A distributed algorithm is snap-stabilizing if it enables a distributed system to resume a cor-rect behavior immediately after transient faults place it in some arbitrary state. In this paper, we propose two probabilistic snap-stabilizing algorithms to solve the local mutual exclusion problem

Probabilistic Snap-Stabilizing Algorithms for Local Resource Allocation Problems Master degree subject

by Karine Altisen, Stéphane Devismes, Verimag Lab
"... Scientific Context. Modern networks are very large-scale (about 100 000 nodes). Now, the more a network contains nodes, the greater the probability of failures is. Hence, today fault-tolerance is a main concern for distributed algorithm designers. In particular, since several decades, there is a gro ..."
Abstract - Add to MetaCart
growing interest for self-repairing methods. For example, (deterministic) self-stabilization [Dij74] is a versatile property, enabling a distributed algorithm to withstand transient faults in a network. Indeed, a self-stabilizing algorithm, after transient faults (e.g., memory corruptions, message losses

On Probabilistic Snap-Stabilization

by Karine Altisen
"... Abstract. In this paper, we introduce probabilistic snap-stabilization. We re-lax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after th ..."
Abstract - Add to MetaCart
Abstract. In this paper, we introduce probabilistic snap-stabilization. We re-lax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after

Snap-Stabilizing Committee Coordination

by Borzoo Bonakdarpour, Franck Petit - in "25th IEEE International Parallel and Distributed Processing Symposium (IPDPS , 2011
"... 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 ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
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

Snap-Stabilizing Message Forwarding algorithm on tree topologies ⋆

by Alain Cournier, Swan Dubois, Anissa Lamani, Franck Petit , 2011
"... Abstract. In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the num ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. In this paper, we propose a snap-stabilizing algorithm for the message forwarding problem that uses the same complexity on the number of buffers as [1] and works on tree topologies.

Snap-stabilizing prefix tree for peer-to-peer systems

by Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi - Parallel Processing Letters , 2010
"... Abstract. Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resourc ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
resources. Self-stabilization is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes

Snap-stabilizing Prefix Tree for Peer-to-peer Systems

by École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi, École Normale, Supérieure Lyon, Eddy Caron, Frédéric Desprez, Franck Petit, Cédric Tedeschi , 2007
"... Resource Discovery is a crucial issue in the deployment of computational grids over large scale peer-to-peer platforms. Because they efficiently allow range queries, Tries (a.k.a., Prefix Trees) appear to be among promising ways in the design of distributed data structures indexing resources. Self-s ..."
Abstract - Add to MetaCart
is an efficient approach in the design of reliable solutions for dynamic systems. A snap-stabilizing algorithm guarantees that it always behaves according to its specification. In other words, a snap-stabilizing algorithm is also a self-stabilizing algorithm which stabilizes in 0 steps. In this paper, we provide

State-Optimal Snap-Stabilizing PIF in Tree Networks (Extended Abstract)

by Alain Bui, Ajoy K. Datta, Franck Petit, Vincent Villain - In Proceedings of the Fourth Workshop on Self-Stabilizing Systems , 1999
"... ) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm proto ..."
Abstract - Cited by 64 (29 self) - Add to MetaCart
) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm

Two snap-stabilizing point-to-point communication protocols in message-switched networks

by Alain Cournier, Swan Dubois, Vincent Villain , 905
"... A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol to solve the message forwarding problem in a message-switched network. In this problem, we must manage resources of the system to deliver ..."
Abstract - Add to MetaCart
to deliver messages to any processor of the network. In this purpose, we use information given by a routing algorithm. By the context of stabilization (in particular, the system starts in an arbitrary configuration), this information can be corrupted. So, the existence of a snap-stabilizing protocol

Snap-Stabilizing PIF Algorithm in Arbitrary Networks

by Alain Cournier, Ajoy K. Datta, Franck Petit, Vincent Villain , 2002
"... We present the rst snap-stabilizing Propagation of Information with Feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from any arbitrary initial system con guration, always behaves according to its speci cation. In other words, a snap-stabilizing protocol is a t ..."
Abstract - Cited by 15 (8 self) - Add to MetaCart
We present the rst snap-stabilizing Propagation of Information with Feedback (PIF) protocol in arbitrary networks. A snap-stabilizing protocol, starting from any arbitrary initial system con guration, always behaves according to its speci cation. In other words, a snap-stabilizing protocol is a
Results 1 - 10 of 24