A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor (Q1117686): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90117-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057250743 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fault Diagnosis in a Boolean n Cube Array of Microprocessors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3338254 / rank | |||
Normal rank | |||
Latest revision as of 13:38, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor |
scientific article |
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
