Fault tolerance in hyperbus and hypercube multiprocessors using partitioning scheme
Resource
Parallel and Distributed Systems, 1994. International Conference on
Journal
International Conference on Parallel and Distributed Systems, 1994
Pages
Paralle-l
Date Issued
1994-12
Date
1994-12
Author(s)
Wang, Shih-Chang
DOI
N/A
Abstract
In this paper, the partitioning scheme is used to achieve fault tolerance in hyperbus and hypercube multiprocessors. Unlike other schemes, processor faults are assumed to be randomly distributed. We propose a novel and practical load redistribution method to tolerate processor faults in a hyperbus structure with insignificant overhead (a slowdown of 2 for computation and a slowdown of 3 for communication in the worst case). Standard routing and broadcasting algorithms were implemented on hypercube computers. To achieve fault tolerance, we present routing and broadcasting algorithms for a faulty hypercube with at most n-1 faults. Compared with other existing algorithms, our methods have better performance in most measures.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00590319.pdf
Size
786.21 KB
Format
Adobe PDF
Checksum
(MD5):8c70b2b922092f9654a04ad40a621455