Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li Sheng ; Dept. of Math. & Comput. Sci., Drexel Univ., Philadelphia, PA, USA ; Jie Wu

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

Published in:

Computers, IEEE Transactions on  (Volume:49 ,  Issue: 9 )

Date of Publication:

Sep 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.