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

model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it only requires 2d-1 time units for non-faulty hypercubes. For the shouting model, the new scheme requires d+1 time units that are optimal for faulty-hypercubes and d time units for non-faulty hypercubes

Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fault-tolerant 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 non-faulty) hypercube

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 non-faulty processors can be used to perform the allocation in parallel

f (u) and deg f (v) are the numbers of non-faulty neighbors of the nodes u and v in G, respectively. We show that the hypercube networks are strongly fault-tolerant and develop an algorithm that constructs the maximum number of node-disjoint paths in a hypercube network with faults. Our algorithm

plus processors), λ is the number of links which are either faulty, or non-faulty but adjacent to faulty processors, and δn(γ) is the diameter of the hypercube.

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

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 non-faulty processors can be used to perform the allocation in parallel

Abstract: A Connected tree-hypercube with faulty links and/or nodes is called injured tree-hypercube. 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

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 fault-free path of nearly optimal length with very high probability. The algorithm uses the adaptive binomial-tree to select a suitable