By Topic

On the design of efficient multistage interconnection 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

2 Author(s)
Potlapalli, Yashovardhan R. ; Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA ; Agrawal, D.P.

We present an algorithm that characterizes the set of permutations realizable in a single pass by a buddy-type MIN. We use the algorithm to develop a procedure that defines a buddy-type network which will realize a given set of permutations in a single pass through the network. We also present an algorithm to define a biped-type network which realizes a given set of permutations in a single pass. This algorithm is useful when the set of permutations cannot be realized by any buddy-type network in a single pass

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96., Proceedings of the Fourth International Workshop on

Date of Conference:

1-3 Feb 1996