Results 1  10
of
54
A Taxonomy of Daemons in SelfStabilization
, 2011
"... We survey existing scheduling hypotheses made in the literature in selfstabilization, commonly referred to under the notion of daemon. We show that four main characteristics (distribution, fairness, boundedness, and enabledness) are enough to encapsulate the various differences presented in existin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We survey existing scheduling hypotheses made in the literature in selfstabilization, commonly referred to under the notion of daemon. We show that four main characteristics (distribution, fairness, boundedness, and enabledness) are enough to encapsulate the various differences presented
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 38 (6 self)
 Add to MetaCart
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
Anonymous Daemon Conversion in Selfstabilizing Algorithms by Randomization in Constant
"... Abstract. We propose a generalized scheme that can convert any algorithm that selfstabilizes under an unfair central daemon into a randomized one that selfstabilizes under a distributed daemon, using only constant extra space and without IDs. If the original algorithm is anonymous the resulting se ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We propose a generalized scheme that can convert any algorithm that selfstabilizes under an unfair central daemon into a randomized one that selfstabilizes under a distributed daemon, using only constant extra space and without IDs. If the original algorithm is anonymous the resulting
SELFSTABILIZING GRAPH PROTOCOLS
 PARALLEL PROCESSING LETTERS
, 2006
"... We provide selfstabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggybacking on the ..."
Abstract
 Add to MetaCart
We provide selfstabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy
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 Δ + 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
Uniform Randomized SelfStabilizing Mutual Exclusion on Unidirectional Ring under Unfair CDaemon
 Proc. 2nd Workshop on SelfStabilizing Systems
, 1995
"... A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is called selfstabilizing if it converges to a correct system state no matter which system state it is started with. A selfstabilizing system is consid ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
known that if the number of processes (i.e., ring size) is composite, there is no deterministic system, even if cdaemon is assumed. We present a randomized selfstabilizing mutual exclusion system working under cdaemon. We allow the system to have a composite number of processes, and cdaemon to produce an unfair
An Updated Selfstabilizing Algorithm to Maximal 2packing and A Linear Variation under Synchronous Daemon
"... Abstract — In this paper, we first propose an IDbased, constant space, selfstabilizing algorithm that stabilizes to a maximal 2packing in an arbitrary graph. Using a graph G = (V,E) to represent the network, a subset S ⊆ V is a 2packing if ∀i ∈ V: N[i] ∩ S  ≤ 1. Selfstabilization is a parad ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — In this paper, we first propose an IDbased, constant space, selfstabilizing algorithm that stabilizes to a maximal 2packing in an arbitrary graph. Using a graph G = (V,E) to represent the network, a subset S ⊆ V is a 2packing if ∀i ∈ V: N[i] ∩ S  ≤ 1. Selfstabilization is a
An Efficient Selfstabilizing Distance2 Coloring Algorithm
"... Abstract. We present a selfstabilizing algorithm for the distance2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δ 2 m)movesusingatmostΔ 2 + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We present a selfstabilizing algorithm for the distance2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δ 2 m)movesusingatmostΔ 2 + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph
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 9 (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
Randomized Selfstabilizing Algorithms for Wireless Sensor Networks
, 2006
"... Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditiona ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
scheduler, unique processor identifiers, and atomicity. This paper proposes problemindependent transformations for algorithms that stabilize under the central daemon scheduler such that they meet the demands of a WSN. The transformed algorithms use randomization and are probabilistically selfstabilizing
Results 1  10
of
54