Results 1  10
of
44
SATBased Synthesis of FaultTolerance
"... We present a technique where we use SAT solvers in automatic synthesis of faulttolerant distributed programs from their faultintolerant version. Since adding faulttolerance to distributed programs is NPcomplete, we use stateoftheart SAT solvers to benefit from efficient heuristics integrated i ..."
Abstract

Cited by 26 (17 self)
 Add to MetaCart
We present a technique where we use SAT solvers in automatic synthesis of faulttolerant distributed programs from their faultintolerant version. Since adding faulttolerance to distributed programs is NPcomplete, we use stateoftheart SAT solvers to benefit from efficient heuristics integrated in SAT solvers to deal with the exponential complexity of adding faulttolerance. Also, such SATbased technique has the potential to use multiple instances of SAT solvers simultaneously so that independent subproblems can be solved in parallel during synthesis.
Selfstabilizing Vertex Coloring of Arbitrary Graphs
 IN 4TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS’2000
, 2000
"... A selfstabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit... ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
(Show Context)
A selfstabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit...
Transformations for writeallwithcollision model
 Computer Communications (Elsevier
, 2003
"... Dependable properties such as selfstabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed systems where such selfstabilizing algorithms have been designed. Since these existing algorithms are designed in read/w ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
(Show Context)
Dependable properties such as selfstabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed systems where such selfstabilizing algorithms have been designed. Since these existing algorithms are designed in read/write model (or variations thereof), they cannot be directly applied in sensor networks. For this reason, we consider a new atomicity model, write all with collision (WAC), that captures the computations of sensor networks and focus on transformations from read/write model to WAC model and vice versa. We show that the transformation from WAC model to read/write model is stabilization preserving, and the transformation from read/write model to WAC model is stabilization preserving for timed systems. In the transformation from read/write model to WAC model, if the system is untimed (asynchronous) and processes are deterministic then under reasonable assumptions, we show that (1) the resulting program in WAC model can allow at most one process to execute, and (2) the resulting program in WAC model cannot be stabilizing.
Conflict Managers for Selfstabilization without Fairness Assumption
"... In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is st ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of selfstabilizing algorithms that operate in an essentially sequential model, into selfstabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer requires initial symmetry breaking but preserves the original algorithm guarantees.
Tiara: A selfstabilizing deterministic skip list
 IN PROC. 10TH INT. SYMP. ON STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS (SSS
, 2008
"... We present Tiara — a selfstabilizing peertopeer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 01 skip list. We rigorously prove the algorithm ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
We present Tiara — a selfstabilizing peertopeer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 01 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its extension to a ring and incorporation of crash tolerance.
Linear Time SelfStabilizing Colorings
, 2003
"... We propose two new selfstabilizing distributed algorithms for proper Δ + 1(Δ is the maximum degree of a node in the graph) colorings of arbitrary system graphs. Both algorithms are capable of working with multiple type of daemons (schedulers) as is the most recent algorithm by G ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We propose two new selfstabilizing distributed algorithms for proper &Delta; + 1(&Delta; is the maximum degree of a node in the graph) colorings of arbitrary system graphs. Both algorithms are capable of working with multiple type of daemons (schedulers) as is the most recent algorithm by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 5570]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes and m is the number of edges in the graph) as opposed to the O(&Delta; &times; n) moves required by the algorithm by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 5570]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of &Delta;, as is required by Gradinariu and Tixeuil [OPODIS'2000, 2000, pp. 5570]. Further, the coloring produced by our first algorithm provides an interesting type of coloring, called a Grundy Coloring [Jensen and Toft, Graph Coloring Problems, 1995].
Fault Tolerant Distributed Coloring Algorithms That Stabilize in Linear Time
 in Proceedings of the IEEE IPDPS
, 2002
"... We propose two new selfstabilizing distributed algorithms for proper Δ+1 (Δ is the maximum degree of a node in the graph) coloring of arbitrary system graphs. Both algorithms are capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1] ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We propose two new selfstabilizing distributed algorithms for proper &Delta;+1 (&Delta; is the maximum degree of a node in the graph) coloring of arbitrary system graphs. Both algorithms are capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes and m is the number of edges in the graph) as opposed to the O(&Delta;&times;n) moves required by the algorithm [1]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of &Delta;, as is required in [1]. Further, the coloring produced by our first algorithm provides an interesting special case of coloring, e.g., Grundy Coloring [2].
Selfstabilizing philosophers with generic conflicts
 In 8th International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS’06
, 2006
"... We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is moti ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems including problems in wireless sensor networks. We present a selfstabilizing deterministic algorithm — GDP that solves this generalized problem. Our algorithm is terminating. We formally prove GDP correct and evaluate its performance. We extend the algorithm to handle a similarly generalized drinking philosophers and the committee coordination problem. We describe how GDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.
Time Optimal Asynchronous Selfstabilizing Spanning Tree
"... Abstract. This paper presents an improved and timeoptimal selfstabilizing algorithm for a major task in distributed computing a rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents an improved and timeoptimal selfstabilizing algorithm for a major task in distributed computing a rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known. The algorithm assumes asynchronous and reliable FIFO message passing and unique identifiers, and works in dynamic networks and for any network topology. One of the previous timeoptimal algorithms for this task was designed for a model with coarsegrained atomic operations and can be shown not to work properly for the totally asynchronous model (with just “read” or “receive ” atomicity, and “write ” or “send ” atomicity). We revised the algorithm and proved it for a more realistic model of totally asynchronous networks. The state in the presented algorithm does not stabilize until long after the required output does. For such an algorithm, an increased asynchrony poses much increased hardness in the proof. 1