Title :
A note on “A tight lower bound on the number of channels required for deadlock-free wormhole routing”
Author :
Sheng, Li ; Wu, Jie
Author_Institution :
Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USA
fDate :
9/1/2000 12:00:00 AM
Abstract :
R. Libeskind-Hadas (1998) provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. In this paper, we show a simpler proof of the tight lower bound
Keywords :
multiprocessor interconnection networks; network routing; deadlock-free wormhole routing; tight lower bound; Intelligent networks; Labeling; Multiprocessor interconnection networks; Routing; System recovery;
Journal_Title :
Computers, IEEE Transactions on
