Results 1  10
of
24
Stabilizationpreserving atomicity refinement
 IN DISC99 DISTRIBUTED COMPUTING 13TH INTERNATIONAL SYMPOSIUM
, 1999
"... Program renements from an abstract to a concrete model empower designers to reason effectively in the abstract and architects to implement effectively in the concrete. For refinements to be useful, they must not only preserve functionality properties but also dependability properties. In this paper ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
Program renements from an abstract to a concrete model empower designers to reason effectively in the abstract and architects to implement effectively in the concrete. For refinements to be useful, they must not only preserve functionality properties but also dependability properties. In this paper, we focus our attention on refinements that preserve the property of stabilization. We distinguish between two types of stabilizationpreserving refinements  atomicity refinement and semantics refinement  and study the former. Specifically, we present a stabilizationpreserving atomicity refinement from a model where a process can atomically access the state of all its neighbors and update its own state, to a model where a process can only atomically access the state of any one of its neighbors or atomically update its own state. (Of course, correctness properties, including termination and fairness, are also preserved.) Our refinement is based on a lowatomicity, boundedspace, stabilizing solution to the dining philosophers problem. It is readily extended to: (a) solve stabilizationpreserving semantics refinement, (b) solve the drinking philosophers problem, and (c) allow further refinement into a messagepassing model.
SelfStabilizing Local Mutual Exclusion and Daemon Refinement
, 2002
"... Refining selfstabilizing algorithms which use tighter scheduling constraints (weaker daemon) into corresponding algorithms for weaker or no scheduling constraints (stronger daemon), while preserving the stabilization property, is useful and challenging. Designing transformation techniques for these ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
Refining selfstabilizing algorithms which use tighter scheduling constraints (weaker daemon) into corresponding algorithms for weaker or no scheduling constraints (stronger daemon), while preserving the stabilization property, is useful and challenging. Designing transformation techniques for these refinements has been the subject of serious investigations in recent years. This paper proposes a new transformation technique for daemon refinement. The core of the transformer is a selfstabilizing local mutual exclusion algorithm. The local mutual exclusion problem is to grant a process the privilege to enter critical section if and only if none of its neighbors has the privilege. The contribution of this paper is twofold. First, we present a boundedmemory selfstabilizing local mutual exclusion algorithm for arbitrary networks, assuming any arbitrary daemon. After stabilization, this algorithm maintains a bound on the service time (the delay between two successive executions of critical section by a particular process). This bound is n(n 1) where n is the network size. Another nice feature of our algorithm is that it satisfies the strong safety property  in any configuration, there is at least one privileged processor. Second, we use the local mutual exclusion algorithm to design two transformers which convert the algorithms working under a weaker daemon to ones which work under the distributed, arbitrary (or unfair) daemon. Both transformers preserve the selfstabilizing property. The first transformer refines algorithms written under the central daemon, while the second transformer refines algorithms designed for the kfair (k (n 1)) daemon.
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 16 (8 self)
 Add to MetaCart
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.
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]. The fi ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
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]. 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(Δ×n) moves required by the algorithm [1]. The second improvement is that neither of the proposed algorithms requires each node to have knowledge of Δ, 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 10 (1 self)
 Add to MetaCart
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.
Dining Philosophers that Tolerate Malicious Crashes
"... We present a solution to the problem of dining philosophers. Our solution tolerates malicious crashes. In a malicious crash the failed process behaves arbitrarily for a finite time and then ceases all operation undetectably to other processes. The tolerance of our solution is achieved by the combina ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We present a solution to the problem of dining philosophers. Our solution tolerates malicious crashes. In a malicious crash the failed process behaves arbitrarily for a finite time and then ceases all operation undetectably to other processes. The tolerance of our solution is achieved by the combination of stabilization and crash failure locality. Stabilization allows our program to recover from an arbitrary state. Crash failure locality ensures that only a limited number of processes are affected by a process crash. The crash failure locality of our solution is optimal. Finally, we argue that the malicious crash fault model and its extensions are worthy of further study as they admit tolerances that are not achieved under stronger fault models and are unnecessary under weaker fault models.
Uniform and Selfstabilizing fair mutual exclusion . . .
, 2002
"... This paper presents a uniform randomized selfstabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (ddaemon).The system is stabilized with probability 1 in O(n³) expected number of steps, and each process is privile ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper presents a uniform randomized selfstabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (ddaemon).The system is stabilized with probability 1 in O(n³) expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized.
Selfstabilizing deterministic TDMA for sensor networks
 PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY (ICDCIT), LNCS 3816
, 2005
"... An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be selfstabilizing so that in the event of corruption of assigned slots and clock drift, ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
An algorithm for time division multiple access (TDMA) is found to be applicable in converting existing distributed algorithms into a model that is consistent with sensor networks. Such a TDMA service needs to be selfstabilizing so that in the event of corruption of assigned slots and clock drift, it recovers to states from where TDMA slots are consistent. Previous selfstabilizing solutions for TDMA are either randomized or assume that the topology is known upfront and cannot change. Thus, the question of feasibility of selfstabilizing deterministic TDMA algorithm where topology is unknown remains open. In this paper, we present a selfstabilizing, deterministic algorithm for TDMA in networks where a sensor is aware of only its neighbors. This is the first such algorithm that achieves these properties. Moreover, this is the first algorithm that demonstrates the feasibility of stabilizationpreserving, deterministic transformation of a shared memory distributed program on an arbitrary topology into a program that is consistent with the sensor network model.
A SelfStabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph
 Computers and Mathematics with Applications
, 2003
"... In a graph # # #####, a set # # # is said to be total dominating if every # # # is adjacent to some member of #. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is a ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In a graph # # #####, a set # # # is said to be total dominating if every # # # is adjacent to some member of #. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Selfstabilization, introduced by Dijkstra [1, 2], is the most inclusive approach to fault tolerance in distributed systems [3, 4]. We propose a new selfstabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph. We also show how the basic ideas behind the proposed protocol can be generalized to solve other related problems.
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 Gradinari ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
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 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(Δ × 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 Δ, 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].