DocumentCode
2031901
Title
Fault Tolerant Subcube Allocation in Hypercubes
Author
Chang, Yeimkuan ; Bhuyan, Laxmi N.
Author_Institution
Texas A&M University
Volume
1
fYear
1993
fDate
16-20 Aug. 1993
Firstpage
132
Lastpage
136
Abstract
The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subcubes is then introduced to take advantage of the advanced switching techniques such as wormhole routing to increase the size of available sub cubes. In this paper, a two-phase fault tolerant subcube allocation strategy is proposed. The first phase is the re configuration process based on a modified subcube parti tioning technique which finds the set of disjoint subcubes in the faulty hypercube. The second phase is to apply an existing fault-free subcube allocation strategy such as Buddy strategy to each disjoint subcube for assigning the fault-free available subcubes to the incoming tasks. The simulation results using Buddy strategy are also given.
Keywords
Computer science; Delay; Fault tolerance; Hypercubes; Interference; Multitasking; Parallel algorithms; Parallel processing; Reflective binary codes; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location
Syracuse, NY, USA
ISSN
0190-3918
Print_ISBN
0-8493-8983-6
Type
conf
DOI
10.1109/ICPP.1993.90
Filename
4134126
Link To Document