Journal article
A note on "A tight lower bound on the number of channels required for deadlock-free wormhole routing"
IEEE transactions on computers, v 49(9), pp 1005-1005
Sep 2000
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.
Metrics
4 Record Views
1 citations in Scopus
Details
- Title
- A note on "A tight lower bound on the number of channels required for deadlock-free wormhole routing"
- Creators
- Li Li Sheng - Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USAJie Jie Wu
- Publication Details
- IEEE transactions on computers, v 49(9), pp 1005-1005
- Publisher
- IEEE
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Scopus ID
- 2-s2.0-0034275302
- Other Identifier
- 991014877907204721