By Topic

Regular CC-banyan networks

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

4 Author(s)
Kim, D.W. ; Texas Univ., Austin, TX, USA ; Lipovski, G.J. ; Hartmann, A. ; Jenevein, R.

Construction algorithms for rectangular and nonrectangular CC-banyan networks, as well as routing algorithms for double-ended and single-ended rectangular and nonrectangular CC-banyan networks, are presented. The time complexities of the routing algorithms are O(l ), where l is the number of stages in the network

Published in:

Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on

Date of Conference:

30 May-2 Jun 1988