Communications of the ACM - Special section on computer architecture
The connection machine
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor
Information Processing Letters
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Distributed subcube identification algorithms for reliable hypercubes
Information Processing Letters
Effective utilization of hypercubes in the presence of faults
Journal of Parallel and Distributed Computing
Traffic Analysis and Simulation Performance of Incomplete Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults
IEEE Transactions on Computers
Subcube Determination in Faulty Hypercubes
IEEE Transactions on Computers
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Submesh Determination in Faulty Tori and Meshes
IEEE Transactions on Parallel and Distributed Systems
Exact wirelength of hypercubes on a grid
Discrete Applied Mathematics
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Discrete Applied Mathematics
Fast and efficient submesh determination in faulty tori
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
Hi-index | 0.00 |
An incomplete hypercube possesses virtually every advantage of complete hypercubes, including simple deadlock-free routing, a small diameter, bounded link traffic density, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty hypercube into a maximum incomplete cube so as to lower potential performance degradation, because a hypercube so reconfigured often results in a much larger system than what is attainable according to any conventional reconfiguration scheme which identifies only complete subcubes. A maximum incomplete subcube involves one maximum complete subcube, plus certain smaller complete subcubes, and, thus, may accommodate multiple jobs of different sizes simultaneously, delivering a higher performance level. This paper proposes an efficient approach for identifying all the maximum incomplete subcubes present in a faulty hypercube. The proposed approach is on the basis of manipulating Boolean expressions, with the search space reduced considerably by taking advantage of the basic properties of faulty hypercubes during expression manipulation. It is distributed, in that every healthy node executes the same identification algorithm independently, at the same time. It is confirmed by fault simulation that our approach indeed gives rise to significantly larger reconfigured systems and requires short execution times.