Title :
A comparison of different wormhole routing schemes
Author :
Lu, Yen-Wen ; Bagchi, Kallol ; Burr, James B. ; Peterson, Allen M.
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., CA, USA
fDate :
31 Jan-2 Feb 1994
Abstract :
Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N×N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement
Keywords :
computer networks; message passing; multiprocessor interconnection networks; network routing; N×N torus; algorithm; computer network; computer networking; hill-climbing version; large multicomputer network; message routing; nearest neighbor connections; nearest neighbour connection; network architecture; network operating system; parallel architecture; simulation; systematic performance scheme; worm1; wormhole routing scheme; Bandwidth; Buffer storage; Costs; Laboratories; Multiprocessing systems; Nearest neighbor searches; Pipelines; Routing; System recovery; Throughput;
Conference_Titel :
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1994., MASCOTS '94., Proceedings of the Second International Workshop on
Conference_Location :
Durham, NC
Print_ISBN :
0-8186-5292-6
DOI :
10.1109/MASCOT.1994.284404
