Title :
Indirect rotator graph networks
Author :
Kim, S. ; Watson, K.L.
Author_Institution :
Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA
fDate :
31 Mar-2 Apr 1996
Abstract :
The indirect rotator graph networks are proposed. The proposed networks are the indirect networks obtained by unfolding the rotator graphs, which are the indirect rotator graph network (IRGN) and the enhanced indirect rotator graph network (EIRGN). The authors show that the indirect network based on the rotator graph performs better than the indirect network based on the star graph in terms of having a reduced number of a switch stages. After proposing the IRGNs, the authors introduce the fault tolerant indirect rotator graph network (FT-IRGN) for use in large scale parallel and distributed systems constructed from the IRGN by adding extra stages, the indirect rotator graph network with (2×2) switches called the IRGN-2×2 that is modular and is constructed from (2×2) crossbar switches, and the ATM switch fabrics based on the IRGN with the various forms
Keywords :
communication complexity; graph theory; multiplexing; multistage interconnection networks; performance evaluation; ATM switch fabrics; fault tolerant indirect rotator graph network; large scale distributed systems; large scale parallel systems; star graph; switch stages; Asynchronous transfer mode; Fabrics; Fault tolerance; Fault tolerant systems; Hypercubes; Large-scale systems; Multiprocessor interconnection networks; Network topology; Switches; Very large scale integration;
Conference_Titel :
System Theory, 1996., Proceedings of the Twenty-Eighth Southeastern Symposium on
Conference_Location :
Baton Rouge, LA
Print_ISBN :
0-8186-7352-4
DOI :
10.1109/SSST.1996.493545
