Title :
Prefix computation on faulty hypercubes
Author :
Jyh-Wen Mao ; Chang-Biau Yang
Author_Institution :
Dept. of Appl. Math., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan
Abstract :
In a parallel computer system, fault-tolerance is more obtainable since there is more than one processor cooperating in the system. For solving parallel prefix computation, we need not use all processors all the time. Thus, we propose a fault-tolerant mechanism by solving the prefix computation problem on faulty hypercube computers. By this mechanism, prefix computation can be done in O(log n) time on a faulty hypercube computer if there exists a fault-free subcube with size of at least a half of the hypercube, and in O(log/sup 2/n) time in the worst case.<>
Keywords :
computational complexity; fault tolerant computing; hypercube networks; O(log n) time; O(log/sup 2/n) time; fault-free subcube; fault-tolerance; fault-tolerant mechanism; faulty hypercubes; parallel computer system; prefix computation; Application software; Computer architecture; Computer errors; Concurrent computing; Fault detection; Fault tolerance; Fault tolerant systems; Hypercubes; Mathematics; Parallel algorithms;
Conference_Titel :
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7803-1233-3
DOI :
10.1109/TENCON.1993.319948
