Efficient distributed routing algorithms for a synchronous circuit-switched hypercube

Author

Csoppenszky, Mike A. ; Somani, Arun K.

Author_Institution

Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA

fYear

1992

fDate

1-3 April 1992

Firstpage

15

Lastpage

22

Abstract

The authors discuss the development and performance of a series of distributed routing algorithms for a synchronous circuit-switched hypercube and enhanced hypercube. Several centralized routing algorithms were developed. All the routing algorithms developed were derived from a single high-level concept of how routing can be accomplished in a circuit-switched hypercube. The routing algorithms were derived from the corresponding packet switching routing algorithm. The routing algorithms have different strengths and weaknesses when compared with one another, and these are considered. It is shown that the highest performing algorithm has an extremely low probability of blocking for the enhanced hypercube and the standard hypercube.<>

Keywords

hypercube networks; parallel architectures; blocking; circuit-switched; distributed routing; enhanced hypercube; hypercube; packet switching; routing algorithms; synchronous; Communication switching; Concurrent computing; Costs; Distributed algorithms; Hypercubes; Integrated circuit interconnections; Multiprocessor interconnection networks; Packet switching; Propagation delay; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Conference_Location

Scottsdale, AZ, USA

Print_ISBN

0-7803-0605-8

Type

conf

DOI

10.1109/PCCC.1992.200533

Filename

200533