Title :
Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm
Author_Institution :
Facultad de Inf., Univ. Politecnica de Valencia, Spain
Abstract :
A new theory for the design of deadlock-free adaptive routing algorithms for wormhole and store-and-forward routing as well as two design methodologies have been proposed previously. In this paper, a new adaptive routing algorithm, obtained from the application of the former theory to the binary n-cube, is evaluated under different load conditions and compared with other algorithms. The results show that the new design methodology supplies faster routing algorithms, at least for those networks with a high connectivity
Keywords :
message passing; multiprocessor interconnection networks; performance evaluation; telecommunication network routing; binary n-cube; deadlock-free adaptive routing algorithm; multicomputers; store-and-forward routing; two design methodologies; wormhole; Algorithm design and analysis; Bandwidth; Delay; Design methodology; Hardware; Multiprocessor interconnection networks; Network topology; Pipelines; Routing; System recovery;
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
DOI :
10.1109/SPDP.1991.218233
