A note on "A tight lower bound on the number of channels required for deadlock-free wormhole routing"

Authors
Sheng, L Wu, J
Citation
L. Sheng et J. Wu, A note on "A tight lower bound on the number of channels required for deadlock-free wormhole routing", IEEE COMPUT, 49(9), 2000, pp. 1005-1005
Citations number
1
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
49
Issue
9
Year of publication
2000
Pages
1005 - 1005
Database
ISI
SICI code
0018-9340(200009)49:9<1005:ANO"TL>2.0.ZU;2-D
Abstract
In [1], Libeskind-Hadas provided a tight lower bound on the number of chann els required by a broad class of deadlock-free wormhole routing algorithms. In this short note. we show a simpler proof of the tight lower bound.