A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor (Q1117686): Difference between revisions

For an n-dimensional hypercube with \(n=2d\) processor nodes, each connected to only d neighbour processors, an algorithm is presented, and its correctness proved, to find the faultless subcubes in the case of identifid faulty processors and/or links in the hypercube. In contrast to other known algorithms the proposed one provides the complete set of maximum-dimensional fault-free subcubes in the system. The algorithm is formulated to run on a single processor which would be typically the host or resource manager of the hypercube system.