DocumentCode
3109549
Title
Hyperswitch network for the hypercube computer
Author
Chow, E. ; Madan, H. ; Peterson, J. ; Grunwald, D. ; Reed, D.
Author_Institution
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
fYear
1988
fDate
30 May-2 Jun 1988
Firstpage
90
Lastpage
99
Abstract
A method is presented that realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies. Available of fault-free paths need not be specified by a source because the routing header can be modified in response to congestion or faults encountered as a path is established. This method can be accomplished in a static topology such as the hypercube network if the nodes have switching elements which are capable of dynamically performing the necessary routing header revisions. Detailed simulation results show that the hyperswitch network is consistently more efficient than fixed-path routing for large message traffic conditions. The simulation results also show that the hyperswitch network has equivalent latency overhead for messages with localized and antilocal destinations (i.e., less than a 25% difference between diameter 1 and 5)
Keywords
computer networks; parallel processing; antilocal destinations; fault-free paths; hypercube computer; hyperswitch network; interconnection network; localised destinations; routing header; simulation results; switching elements; Computer network reliability; Computer networks; Delay; Hypercubes; Laboratories; Multiprocessor interconnection networks; Network topology; Parallel algorithms; Propulsion; Routing; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
0-8186-0861-7
Type
conf
DOI
10.1109/ISCA.1988.5214
Filename
5214
Link To Document