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

The KR-Benes network: a control-optimal rearrangeable permutation network

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

1 Author(s)
Kannan, R. ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA

The Benes network has been used as a rearrangeable network for over 40 years, yet the uniform N(2 log N-1) control complexity of the N/spl times/N Benes is not optimal for many permutations. In this paper, we present a novel O(log N) depth rearrangeable network, called KR-Benes, that is permutation-specific control-optimal The KR-Benes routes every permutation with the minimal control complexity specific to that permutation and its worst-case complexity for arbitrary permutations is bounded by the Benes; thus, it replaces the Benes when considering control complexity/latency. We design the KR-Benes by first constructing a restricted 2log K+2 depth rearrangeable network called K-Benes for routing K-bounded permutations with control 2N log K, 0/spl les/K/spl les/N/4. We then show that the N/spl times/N Benes network itself (with one additional stage) contains every KR-Benes network as a subgraph and use this property to construct the KR-Benes network. With regard to the control-optimality of the KR-Benes, we show that any optimal network for rearrangeably routing K-bounded permutations must have depth 2log K+2 and, therefore, the K-Benes (and, hence, the KR-Benes) is optimal.

Published in:

Computers, IEEE Transactions on  (Volume:54 ,  Issue: 5 )

Date of Publication:

May 2005

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.