By Topic

Fast self-routing permutation switching on an asymptotically minimum cost 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

2 Author(s)
Ching Yuh Jan ; Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA ; Oruc, A.Y.

A self-routing permutation network with O((n lg n)) switches and O(lg2n) routing time, where lg denotes log2, is presented. More generally, a permutation network with O(kn1+1k/) cost and O(k lg n) routing time for any k, 1⩽k lg n, is described. This improves D. Nassimi and J. Sahni's (1982) routing algorithm that gives O(k lg3 n) routing time for the same cost expression. The only networks capable of permutation switching with O(n lg n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing network, but the constants hidden in the complexities of these networks are so large that they remain impractical until n gets very large

Published in:

Computers, IEEE Transactions on  (Volume:42 ,  Issue: 12 )