A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Prefix computation on faulty hypercubes
Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation
Preserved Fulltext
In a parallel computer system, fault-tolerance is more obtainable since there are more than one processor cooperated in the system. And, for solving parallel prefix computation, we need not use all processors all the time. Thus, we shall propose a fault-tolerant mechanism when we solve the prefix computation problem on faulty hypercube computers. By our mechanism, prefix computation can be done in O(1og n) time on a faulty hypercube computer if there exists a fault-free subcube with size being
doi:10.1109/tencon.1993.319948
fatcat:f3g5fgnzgzbq3ktyuyouhnbwzm