A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor (Q1117686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4092726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor |
scientific article; zbMATH DE number 4092726 |
Statements
A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor (English)
0 references
1988
0 references
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.
0 references
parallel processing
0 references
combinatorial problem
0 references
fault tolerance
0 references
hypercube
0 references
0.8662967085838318
0 references
0.8558317422866821
0 references
0.8281202912330627
0 references
0.8278774619102478
0 references
0.8243265748023987
0 references
