Results 1  10
of
19
Extension of Nonfaulty Subcubes Set In a Faulty Hypercube Multiprocessor
, 1998
"... In this study we considered and analyzed the different cases of node and linkfaults in a hypercube multiprocessor. We revealed that, the direct use of sharp product operation is not sufficient to discard only computational part (processor and memory), when only this part of node is faulty. We also ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this study we considered and analyzed the different cases of node and linkfaults in a hypercube multiprocessor. We revealed that, the direct use of sharp product operation is not sufficient to discard only computational part (processor and memory), when only this part of node is faulty. We also
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
model, the new scheme requires 2d time units that are optimal for faultyhypercubes. Moreover, it only requires 2d1 time units for nonfaulty hypercubes. For the shouting model, the new scheme requires d+1 time units that are optimal for faultyhypercubes and d time units for nonfaulty hypercubes
Fault Tolerance in Hypercube Systems and Implementation of Fault Tolerant Algorithms
"... Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for faulttolerant routing in hypercube systems. First algorithm[1] proposes an approach to determine the shortest path between the source and the destination nodes in a faulty (or nonfaulty) hypercube. Sec ..."
Abstract
 Add to MetaCart
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for faulttolerant routing in hypercube systems. First algorithm[1] proposes an approach to determine the shortest path between the source and the destination nodes in a faulty (or nonfaulty) hypercube
Parallel Allocation Algorithms For Hypercubes And Meshes
, 1989
"... We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Although the usual practice is to use a serial algorithm on the host processor to do the allocation, we show how the free and nonfaulty processors can be used to perform the allocation in parallel. The ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Although the usual practice is to use a serial algorithm on the host processor to do the allocation, we show how the free and nonfaulty processors can be used to perform the allocation in parallel
Parallel Routing in Hypercube Networks with Faulty Nodes
 in IEEE International Conference on Parallel and Distributed Systems (ICPADS ’01
, 2000
"... The concept of strong faulttolerance was introduced to characterize the property of parallel routing [15]. A network G of degree d is said strongly faulttolerant if with at most d 2 faulty nodes, any two nodes u and v in G are connected by minfdeg f (u); deg f (v)g nodedisjoint paths, where deg ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
f (u) and deg f (v) are the numbers of nonfaulty neighbors of the nodes u and v in G, respectively. We show that the hypercube networks are strongly faulttolerant and develop an algorithm that constructs the maximum number of nodedisjoint paths in a hypercube network with faults. Our algorithm
Distributed Computing on Oriented Anonymous Hypercubes with Faulty Components ∗
"... We give efficient algorithms for distributed computation on anonymous, labeled, asynchronous oriented hypercubes with possible faulty components (i.e. processors and links) and deterministic processors. Initially, the processors know only the size of the network and that they are interconnected in ..."
Abstract
 Add to MetaCart
plus processors), λ is the number of links which are either faulty, or nonfaulty but adjacent to faulty processors, and δn(γ) is the diameter of the hypercube.
Hypercube message routing in the presence of faults
 in Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications
, 1988
"... We discuss the problem of routing messages on hypercubes which have faulty processors and/or communication links. We are motivated by the belief that simple algorithms, operating under simple assumptions, can ensure high probabilities of successful message routing. In this paper, we consider the bas ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We discuss the problem of routing messages on hypercubes which have faulty processors and/or communication links. We are motivated by the belief that simple algorithms, operating under simple assumptions, can ensure high probabilities of successful message routing. In this paper, we consider
PARALLEL ALLOCATION ALGORITHMS FOR HYPERCUBES AND MESHES Abstract (Preliminary Version)
"... We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Although the usual practice is to use a serial algorithm on the host processor to do the allocation, we show how the free and nonfaulty processors can be used to perform the allocation in parallel. The ..."
Abstract
 Add to MetaCart
We consider the problem of subsystem allocation in the mesh, torus, and hypercube multicomputers. Although the usual practice is to use a serial algorithm on the host processor to do the allocation, we show how the free and nonfaulty processors can be used to perform the allocation in parallel
Adaptive Fault Tolerant Routing Algorithm for TreeHypercube Multicomputer
"... Abstract: A Connected treehypercube with faulty links and/or nodes is called injured treehypercube. To enable any non faulty node to communicate with any other non faulty node in an injured treehypercube, the information on component failures has to be made available to non faulty nodes to route m ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: A Connected treehypercube with faulty links and/or nodes is called injured treehypercube. To enable any non faulty node to communicate with any other non faulty node in an injured treehypercube, the information on component failures has to be made available to non faulty nodes to route
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive BinomialTree Technique in Hypercubes
"... Abstract. We propose an efficient faulttolerant routing algorithm for hypercube networks with a very large number of faulty nodes. The algorithm is distributed and localinformationbased in the sense that each node in the network knows only its neighbors ’ status and no global information of the n ..."
Abstract
 Add to MetaCart
of the network is required by the algorithm. For any two given nonfaulty nodes in a hypercube network that may contain a large fraction of faulty nodes, the algorithm can find a faultfree path of nearly optimal length with very high probability. The algorithm uses the adaptive binomialtree to select a suitable
Results 1  10
of
19