By Topic

Asymptotically Optimal Interconnection Networks from Two-State Cells

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)
Kin-Man Chung ; Department of Computer Science, University of Illinois ; Wong, C.K.

Some special classes of interconnection networks for n terminals are considered, namely, partitioning networks and full switches. Constructions for them are presented. For the former, the resulting total count of (two-state) cels is n log2n + n − log2n − 1, and the maximum delay is 6 log2n − 4. For the latter, the cell count is (n/2)log2n − (n/2) and the maximum delay is 2 log2n − 1. By establishing appropriate lower bounds, we show that these networks are asymptotically optimal as far as cell count is concerned.

Published in:

Computers, IEEE Transactions on  (Volume:C-28 ,  Issue: 7 )