Results 1  10
of
412
An Optimal (d1)FaultTolerant AlltoAll Broadcasting Scheme for dDimensional Hypercubes
"... Alltoall broadcasting (Gossiping) is the process of information dissemination in a communication network. Each member in the network has a message to transmit to all other members of the network. We proposed a kfault tolerant scheme for a faulty ddimensional hypercube with n = 2 nodes where ..."
Abstract
 Add to MetaCart
Alltoall broadcasting (Gossiping) is the process of information dissemination in a communication network. Each member in the network has a message to transmit to all other members of the network. We proposed a kfault tolerant scheme for a faulty ddimensional hypercube with n = 2 nodes where
An Optimal d1FaultTolerant Broadcasting Scheme for dDimensional Hypercubes
, 1994
"... Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a kfaulttolerant broadcasting scheme for a faulty ddimensional hypercube where 0k<d. For the whispering mod ..."
Abstract
 Add to MetaCart
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a kfaulttolerant broadcasting scheme for a faulty ddimensional hypercube where 0k<d. For the whispering
OPTIMAL SUBCUBE ALLOCATION IN A CIRCUITSWITCHED FAULTY HYPERCUBE
, 1998
"... In this paper, we present a scheme where a (d;1)dimensional subcube is allocated in a faulty ddimensional circuitswitched hypercube in the presence of up to 2 (d;1) faulty nodes. The scheme is then extended to allocate a (d; 1)dimensional subcube in the presence of a combination of faulty nodes ..."
Abstract
 Add to MetaCart
In this paper, we present a scheme where a (d;1)dimensional subcube is allocated in a faulty ddimensional circuitswitched hypercube in the presence of up to 2 (d;1) faulty nodes. The scheme is then extended to allocate a (d; 1)dimensional subcube in the presence of a combination of faulty nodes
Routing Complexity of Faulty Networks
 In Proc. of 24th Annu. ACM Symp.on Principles of Distributed Computing (PODC ’05
, 2004
"... One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. Our main results show tight upper and lower bounds for the failure probability which permits routing, both for the hypercube and for the ddimensional mesh. We use tools from percolation theory to show that in the ddimensional mesh, once a giant component appears  efficient routing is possible. A
Construction of dDimensional Hyperoctrees on a Hypercube Multiprocessor
"... We present a parallel algorithm for the construction of the hyperoctree representing a ddimensional object from a set of n (d; 1)dimensional hyperoctrees, representing adjacent crossections of this object. On a pprocessor SIMD hypercube the time complexity ofour algorithm is O ( m p log p log n), ..."
Abstract
 Add to MetaCart
We present a parallel algorithm for the construction of the hyperoctree representing a ddimensional object from a set of n (d; 1)dimensional hyperoctrees, representing adjacent crossections of this object. On a pprocessor SIMD hypercube the time complexity ofour algorithm is O ( m p log p log n
Fast computation using faulty hypercubes
, 1989
"... We consider the computational power of a hypercube containing a potentially large number of randomly located faulty components. Wedescribe a randomized algorithm which embeds an Nnode hypercube in an Nnode hypercube with faulty processors. Provided that the processors of the Nnode hypercube are f ..."
Abstract

Cited by 32 (3 self)
 Add to MetaCart
We consider the computational power of a hypercube containing a potentially large number of randomly located faulty components. Wedescribe a randomized algorithm which embeds an Nnode hypercube in an Nnode hypercube with faulty processors. Provided that the processors of the Nnode hypercube
ABSTRACT Routing Complexity of Faulty Networks
"... One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the capability to efficiently find a path in the network is lost. ..."
Abstract
 Add to MetaCart
. Our main results show tight upper and lower bounds for the failure probability which permits routing, both for the hypercube and for the d−dimensional mesh. We use tools from percolation theory to show that in the d−dimensional mesh, once a giant component appears — efficient routing is possible. A
The Longest Ring Embedding in Faulty Hypercube
 PROCEEDINGS OF THE 23RD WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATIONAL THEORY
, 2006
"... In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the faultfree cycle with length 2 n − 2  Fv  +4 in Qn − Fv where Fv is the fau ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the faultfree cycle with length 2 n − 2  Fv  +4 in Qn − Fv where Fv
Cycle Embedding in the Hypercube with Faulty Nodes
"... The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a faultfree cycle of length of at least 2 n − 2f can be embedded in an n dimensional hypercube with f faulty nodes, where n ≥ 3 and 1 ≤ f ≤ 2n − 4. ..."
Abstract
 Add to MetaCart
The hypercube is one of the most versatile and efficient interconnection networks yet discovered for parallel computation. In this paper, we show that a faultfree cycle of length of at least 2 n − 2f can be embedded in an n dimensional hypercube with f faulty nodes, where n ≥ 3 and 1 ≤ f ≤ 2n − 4
Results 1  10
of
412