Results 1  10
of
38
ON DISTRIBUTED SNAPSHOTS
, 1987
"... We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be firstinfirstout. We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be firstinfirstout. We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can be further simplified.
The wakeup problem
 SIAM Journal on Computing
, 1996
"... We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
We study a new problem, the wakeup problem, that seems to be fundamental in distributed computing. We present efficient solutions to the problem and show how these solutions can be used to solve the consensus problem, the leader election problem, and other related problems. The main question we try to answer is, how much memory is needed to solve the wakeup problem? We assume a model that captures important properties of real systems that have been largely ignored by previous work on cooperative problems.
An Alternative Solution to a Problem on SelfStabilization
 ACM Transactions on Programming Languages and Systems
, 1993
"... Dijkstra [4] [6] introduced the problem of selfstabilization in distributed systems as an interesting exercise for achieving global convergence through local actions. In [4], he presented three solutions to a specific version of the selfstabilization problem, one of which was proved in [5]. This p ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Dijkstra [4] [6] introduced the problem of selfstabilization in distributed systems as an interesting exercise for achieving global convergence through local actions. In [4], he presented three solutions to a specific version of the selfstabilization problem, one of which was proved in [5]. This paper presents an alternative solution to his selfstabilization problem with fourstate machines. Categories and Subject Descriptors: C.2.4 [ComputerCommunication Network]: Distributed Systems  distributed applications; D.4.1 [Operating Systems]: Process Management  synchronization. General Terms: Theory, Algorithms. Additional Keywords and Phrases: Selfstabilization, distributed algorithm, synthesis. 1 Introduction The task of synchronization in a distributed system corresponds to maintaining an invariance relationship over the global state of the system. When the invariant holds, the system is in the legitimate state, otherwise, the system state is illegitimate. A selfstabilizin...
SelfStabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
 In WAPDCMâ€™03: 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models
, 2003
"... We propose two distributed algorithms to maintain, respectively, a maximal matching and a maximal independent set in a given ad hoc network; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We propose two distributed algorithms to maintain, respectively, a maximal matching and a maximal independent set in a given ad hoc network; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the global predicates. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result, the nodes get the information about their neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the selfstabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of an adversary deamon used in proving the convergence and correctness of selfstabilizing distributed algorithms in general.
A SelfStabilizing Leader Election Algorithm for Tree Graphs
 Journal of Parallel and Distributed Computing
, 1996
"... We propose a self stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction. 1 Introduction In a distributed system the computing elements or nodes exchange information only by message passing. ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We propose a self stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction. 1 Introduction In a distributed system the computing elements or nodes exchange information only by message passing. Every node has a set of local variables whose contents specify the local state of the node. The state of the entire system, called the global state, is the union of the local states of all the nodes in the system. Each node is allowed to have only a partial view of the global state, and this depends on the connectivity of the system and the propagation delay of different messages. Yet, the objective in a distributed system is to arrive at a desirable global final state (legitimate state), defined by some invariance relation on the global state. Systems that reach the legitimate state starting from any arbitrary (possibly illegitimate) state in a finite number of steps are called selfstabil...
A SelfStabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph
 Computers and Mathematics with Applications
, 1992
"... We propose a simple and efficient selfstabilizing distributed algorithm to construct the breadth first search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The appr ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We propose a simple and efficient selfstabilizing distributed algorithm to construct the breadth first search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The approach seems to have potential to have applications in proving correctness of other selfstabilizing algorithms for graph theoretical problems. Address for Correspondence: Pradip K Srimani Department of Computer Science Colorado State University Ft. Collins, CO 80523 Tel: (303) 4917097 Fax: (303) 4916639 Email: srimani@CS.ColoState.Edu Department of Mathematics y Department of Computer Science 1 Introduction A distributed system can be viewed to consist of a set of loosely connected systems (state machines) which do not share a global memory but can share information by exchanging messages only. Each node or machine is allowed to have only a partial view of the global state which dep...
Selfstabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Sets
 COMPUT. MATH. APPL
, 2003
"... In the selfstabilizing algorithmic paradigm for distributed computation each node has only a local view of the system, yet in a finite amount of time, the system converges to a global state satisfying some desired property. In this paper we present polynomial time selfstabilizing algorithms for ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
In the selfstabilizing algorithmic paradigm for distributed computation each node has only a local view of the system, yet in a finite amount of time, the system converges to a global state satisfying some desired property. In this paper we present polynomial time selfstabilizing algorithms for finding a dominating bipartition, a maximal independent set, and a minimal dominating set in any graph.
A CaseStudy in ComponentBased Mechanical Verification of FaultTolerant Programs
 In Proceedings of 4th Workshop on SelfStabilization. IEEE Computer Society
, 1999
"... In this paper, we present a case study to demonstrate that the decomposition of a faulttolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a componentb ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
In this paper, we present a case study to demonstrate that the decomposition of a faulttolerant program into its components is useful in its mechanical verification. More specifically, we discuss our experience in using the theorem prover PVS to verify Dijkstra's token ring program in a componentbased manner. We also demonstrate the advantages of component based mechanical verification. Keywords : Componentbased verification, Faulttolerance, Program decomposition, Mechanical verification, Selfstabilization 1 Introduction In this paper, we argue that the decomposition of a faulttolerant program into its components is beneficial in its mechanical verification, and that such a decomposition admits reuse of the proofs for other faulttolerant programs as well as the variations of the given faulttolerant program. Arora and Kulkarni [3] have shown that a faulttolerant program can be decomposed into a faultintolerant program and a set of `tolerance'components, namely detectors and...
Service Time Optimal SelfStabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
 In SRDS 2002 21st Symposium on Reliable Distributed Systems, IEEE Computer
, 2002
"... on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm).
SpaceEfficient, Distributed and SelfStabilizing DepthFirst Token Circulation
 In Proceedings of the Second Workshop on SelfStabilizing Systems
, 1995
"... The notion of selfstabilization was introduced by Dijkstra. He defined a system as selfstabilizing when "regardless of its initial state, it is guaranteed to arrive at a legitimate state in a finite number of steps". Such a property is very desirable for any distributed system, because after any ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
The notion of selfstabilization was introduced by Dijkstra. He defined a system as selfstabilizing when "regardless of its initial state, it is guaranteed to arrive at a legitimate state in a finite number of steps". Such a property is very desirable for any distributed system, because after any unexpected perturbation modifying the memory state, the system eventually recovers and returns to a legitimate state, without any outside intervention. In this paper, we are interested in a distributed selfstabilizing depthfirst token circulation protocol on an uniform rooted network (no identifiers, but a distinguished root). As already noted, a search algorithm together with a deterministic enumeration of the node's neighbors yields an algorithm determining a spanning tree. Our contribution is improving the best up to now known space complexity for this problem, from O(log(N)) to O(log(D)) where N is number of nodes and D is the network's degree. Moreover, we give a full proof o...