Results 1  10
of
447
Optimal kFaulttolerant . . .
, 2000
"... ... In this paper, we discuss the case of a combination of processor failures and link failures for token rings. By "k faults" we mean kcomponent faults in any combination of processor faults and link faults. Designing an optimal kfault tolerant network for token rings is equivalent ..."
Abstract
 Add to MetaCart
... In this paper, we discuss the case of a combination of processor failures and link failures for token rings. By "k faults" we mean kcomponent faults in any combination of processor faults and link faults. Designing an optimal kfault tolerant network for token rings is equivalent
Performance of KFault Tolerant Checkpointing for Mobile Agents
"... Abstract—This paper studies the performance of two fault tolerant schemes for mobile agents. The behavior and the performance of the kfault tolerant checkpointing scheme are compared with those of the replication schemes. To study the performance of two schemes, an experimental system has been buil ..."
Abstract
 Add to MetaCart
Abstract—This paper studies the performance of two fault tolerant schemes for mobile agents. The behavior and the performance of the kfault tolerant checkpointing scheme are compared with those of the replication schemes. To study the performance of two schemes, an experimental system has been
On the Constructon of Combined kfault tolerant Hamiltonian Graphs
 NETWORKS 37(3)
, 2001
"... A graph G is a combined kfaulttolerant Hamiltonian graph (also called a combined kHamiltonian graph) if G − F is Hamiltonian for every subset F ⊂ (V(G) ∪ E(G)) with F  =k. A combined kHamiltonian graph G with V(G)  = n is optimal if it has the minimum number of edges among all nnode kHami ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
A graph G is a combined kfaulttolerant Hamiltonian graph (also called a combined kHamiltonian graph) if G − F is Hamiltonian for every subset F ⊂ (V(G) ∪ E(G)) with F  =k. A combined kHamiltonian graph G with V(G)  = n is optimal if it has the minimum number of edges among all nnode k
An Efficient Approach for Mining TopK FaultTolerant Repeating Patterns*
"... Abstract. In this paper, an efficient strategy for mining topK nontrivial faulttolerant repeating patterns (FTRPs in short) with lengths no less than min_len from data sequences is provided. By extending the idea of appearing bit sequences, faulttolerant appearing bit sequences are defined to re ..."
Abstract
 Add to MetaCart
Abstract. In this paper, an efficient strategy for mining topK nontrivial faulttolerant repeating patterns (FTRPs in short) with lengths no less than min_len from data sequences is provided. By extending the idea of appearing bit sequences, faulttolerant appearing bit sequences are defined
Fault tolerant graphs, perfect hash functions and disjoint paths
 In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
, 1992
"... Given a graph G on n nodes we say that a graph T on n + k nodes is a kfault tolerant version of G, if we can embed G in any n node induced subgraph of T. Thus T can sustain k faults and still emulate G without any performance degradation. We show that for a wide range of values of n, k and d, for a ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Given a graph G on n nodes we say that a graph T on n + k nodes is a kfault tolerant version of G, if we can embed G in any n node induced subgraph of T. Thus T can sustain k faults and still emulate G without any performance degradation. We show that for a wide range of values of n, k and d
Improved Algorithms for Constructing FaultTolerant Spanners
 Algorithmica
, 1998
"... Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct kfaulttolerant spanners for S. If in such a spanner at most k vertices and/or edges are removed, then each pair of points in the remaining graph is still connected by a "short" pa ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct kfaulttolerant spanners for S. If in such a spanner at most k vertices and/or edges are removed, then each pair of points in the remaining graph is still connected by a "
FaultTolerant Minimum Broadcast Networks
 NETWORKS
, 1996
"... Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal kfault tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failu ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal kfault tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line
FaultTolerant Geometric Spanners
 DISCRETE & COMPUTATIONAL GEOMETRY
, 2004
"... We present two new results about vertex and edge faulttolerant spanners in Euclidean spaces. We describe the first construction of vertex and edge faulttolerant spanners having optimal bounds for maximum degree and total cost. We present a greedy algorithm that for any t> 1 and any nonnegative ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
negative integer k, constructs a kfaulttolerant tspanner in which every vertex is of degree O(k) and whose total cost is O(k2) times the cost of the minimum spanning tree; these bounds are asymptotically optimal. Our next contribution is an efficient algorithm for constructing good faulttolerant spanners. We
Incubators vs Zombies: FaultTolerant, Short, Thin and Lanky Spanners for Doubling Metrics
, 2012
"... Recently Elkin and Solomon gave a construction of spanners for doubling metrics that has constant maximum degree, hopdiameter O(log n) and lightness O(log n) (i.e., weight O(log n)·w(MST)). This resolves a long standing conjecture proposed by Arya et al. in a seminal STOC 1995 paper. However, Elkin ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
, Elkin and Solomon’s spanner construction is extremely complicated; we offer a simple alternative construction that is very intuitive and is based on the standard technique of net tree with cross edges. Indeed, our approach can be readily applied to our previous construction of kfault tolerant spanners
Explicit Constructions of Fault Tolerant Open Linear Arrays
, 2005
"... Two graph models for a Kfault tolerant linear array with external inputs and outputs are proposed: one is with minimum number of spare nodes and incurs low spare resource overhead, and the other is with small internal degree and incurs small runtime reconfiguration hardware overhead. Both graph mo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Two graph models for a Kfault tolerant linear array with external inputs and outputs are proposed: one is with minimum number of spare nodes and incurs low spare resource overhead, and the other is with small internal degree and incurs small runtime reconfiguration hardware overhead. Both graph
Results 1  10
of
447