Title
A virtually nonblocking self-routing permutation network which routes packets in \mathrm{O}(\log_{2} N) time
Abstract
Asymptotically nonblocking networks are O(log2N ) depth self-routing permutation de- vices in which blocking probability vanishes when N (the number of network inputs) in- creases. This behavior does not guarantee, also for very large N , that all information always and simultaneously reaches its destination (and consequently that a whole permuta- tion passes through the device) which is a requirement of the PRAM machine. In this work the conditions for which an asymptotically nonblocking network becomes asymptotically permutation nonblocking are studied, finally a virtually nonblocking device is obtained by a retransmission procedure which guarantees that all permutations always pass through this permutation device.
Year
Venue
DocType
1998
Telecommunication Systems
Journal
Volume
Issue
Citations 
10
1
0
PageRank 
References 
Authors
0.34
6
2
Name
Order
Citations
PageRank
Giuseppe A. De Biase111.40
Annalisa Massini213715.53