Results 21  30
of
447
On the BorowskyGafni simulation algorithm, brief announcement
 Proceedings of the 15th ACM Symposium on Principles of Distributed Computing
, 1996
"... Consider a read/write asynchronous shared memory system. In [1], Borowsky and G&i describe an algorithm that allows a set of f + 1 processes, any ~ of which may exhibit stopping failures, to “simulate ” a larger number n of processes, also with at most ~ failures. This simulation algorithm is us ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is used in [1] to convert an arbitrary kfaulttolerant nprocess solution for the ksetagreement problem into a waitfree k+ 1process solution for the same problem. Since the k+lprocess ksetagreement problem has been shown to have no waitfree solution (e.g. [1]), this transformation implies
Tolerating Faults in Counting Networks
 In IEEE Workshop on FaultTolerant Parallel and Distributed Systems
, 1999
"... . Counting networks were proposed by Aspnes, Herlihy and Shavit [4] as a technique for solving multiprocessor coordination problems. We describe a method for tolerating an arbitrary number of faults in counting networks. In our fault model, the following errors can occur dynamically in the counting ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
in a counting network. Thus, we transform a counting network with depth O(log 2 n), where n is the width, into a kfaulttolerant counting network with depth O(k log 2 n). The second approach is to append a correction network, built with faulttolerant balancers, to a counting network that may
Design of faulttolerant networks on satellites (TWTA redundancy)
"... This article deals with the design of networks to be loaded on satellites. These networks should connect inputs (corresponding to signals arriving on the satellite) to outputs (corresponding to amplifiers), even in case of failures of amplifiers. They are made of links and expensive switches, hence ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. We call such networks valid kfault tolerant networks. Let N (n; k) denote the minimum...
Fault Tolerant Networks With Small Degree
 In Proceedings of the 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA
, 2000
"... In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G # is called a kfaulttolerant graph of G if when we remove any k nodes from G # , it still contains a subg ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G # is called a kfaulttolerant graph of G if when we remove any k nodes from G # , it still contains a
Power Optimization in FaultTolerant Topology Control Algorithms for Wireless Multihop Networks
 in Proceedings of the 9th Annual International Conference on Mobile Computing and Networking. 2003
, 2003
"... In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining kfault tolerance. Specifically, we require all links established by this power setting be ..."
Abstract

Cited by 84 (6 self)
 Add to MetaCart
In ad hoc wireless networks, it is crucial to minimize power consumption while maintaining key network properties. This work studies power assignments of wireless devices that minimize power while maintaining kfault tolerance. Specifically, we require all links established by this power setting
New Doubling Spanners: Better and Simpler
, 2013
"... In a seminal STOC’95 paper, Arya et al. conjectured that spanners for lowdimensional Euclidean spaces with constant maximum degree, hopdiameter O(log n) and lightness O(log n) (i.e., weight O(log n)· w(MST)) can be constructed in O(n log n) time. This conjecture, which became a central open ques ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
question in this area, was resolved in the affirmative by Elkin and Solomon in STOC’13 (even for doubling metrics). In this work we present a simpler construction of spanners for doubling metrics with the above guarantees. Moreover, our construction extends in a simple and natural way to provide kfault
Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence FaultTolerant Planning under Uncertainty
"... A fault represents some erroneous operation of a system that could result from an action selection error or some abnormal condition. We formally define error models that characterize the likelihood of various faults and consider the problem of faulttolerant planning, which optimizes performance give ..."
Abstract
 Add to MetaCart
theoretical properties. When combined with a continual planning paradigm, the kfaulttolerant planning method can produce nearoptimal performance, even when the number of faults exceeds the bound. Empirical results in two challenging domains confirm the effectiveness of the approach in handling different
On Constructing InterferenceAware kFault Resistant Topologies for Wireless Ad hoc Networks
, 2012
"... The most fundamental problem in wireless adhoc networks is to determine a connected communication subgraph that satisfies desirable topological properties by assigning appropriate transmission power to each node. Some of the properties considered by a vast majority of researchers include minimumen ..."
Abstract
 Add to MetaCart
energy, fault tolerance, minimum interference, and bounded node degree. However preserving two or more combination of these properties at the same time is harder to achieve and often overlooked by the research community. In this paper, we propose a topology control algorithm that preserves connectivity
Robust Communications for Sensor Networks in Hostile Environments
"... Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads (through which communication takes place) may partition the network or degrade application performance. In this work, we prop ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
propose a new approach, REED (Robust Energy Efficient Distributed clustering), for clustering sensors deployed in hostile environments. Our primary objective is to construct a kfault tolerant (i.e., kconnected) network, where k is a constant determined by the application. Fault tolerance can
The BG distributed simulation algorithm
, 1997
"... A snapshot shared memory algorithm is presented, allowing a set off+1processes, any f of which may exhibit stopping failures, to “simulate” a larger number n of processes, also with at most f failures. One application of this simulation algorithm is to convert an arbitrary kfaulttolerant nprocess ..."
Abstract

Cited by 43 (18 self)
 Add to MetaCart
A snapshot shared memory algorithm is presented, allowing a set off+1processes, any f of which may exhibit stopping failures, to “simulate” a larger number n of processes, also with at most f failures. One application of this simulation algorithm is to convert an arbitrary kfaulttolerant n
Results 21  30
of
447