DocumentCode :
2626634
Title :
Scalability of binary deBruijn networks
Author :
Kar, Barun K. ; Pradhan, Dhiraj K.
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear :
1993
fDate :
1-4 Dec 1993
Firstpage :
796
Lastpage :
799
Abstract :
This paper presents a technique to construct scalable binary deBruijn networks. Based on building larger binary deBruijn networks from smaller networks, this technique also provides for the capability of fault-tolerance for graceful degradation and multitasking. A new representation of the binary deBruijn network is presented which provides the basis for scalability
Keywords :
fault tolerant computing; graph theory; multiprocessor interconnection networks; parallel architectures; reliability; binary deBruijn networks; fault-tolerance; graceful degradation; multitasking; Computer architecture; Computer science; Degradation; Electronic mail; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Network topology; Scalability; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
Type :
conf
DOI :
10.1109/SPDP.1993.395451
Filename :
395451
Link To Document :
بازگشت