By Topic

An O(log2 N) depth asymptotically nonblocking

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

3 Author(s)
De Biase, G.A. ; Dipartimento di Sci. dell''Inf., Rome Univ., Italy ; Ferrone, C. ; Massini, A.

A self-routing multi-logN permutation network is presented and studied. This network has 3log2 N-2 depth and N(log2 γN)(3log2, N-2)/2 nodes, where N is the number of network inputs and γ a constant very close to 1. A parallel routing algorithm runs in 3log2N-2 time on this network. The overall system (network and algorithm) can work in pipeline and it is asymptotically nonblocking in the sense that its blocking probability vanishes when N increases, hence the quasi-totality of the information synchronously arrives in 3log2N-2 steps at the network outputs. This network presents very good fault tolerance, a modular architecture, and it is suitable for information exchange in very large scale parallel processors and communication systems

Published in:

Computers, IEEE Transactions on  (Volume:44 ,  Issue: 8 )