
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C. Ferrone, G.a. De Biase, A. Massini, "An O(log2 N) Depth Asymptotically Nonblocking SelfRouting Permutation Network," IEEE Transactions on Computers, vol. 44, no. 8, pp. 10471051, August, 1995.  
BibTex  x  
@article{ 10.1109/12.403721, author = {C. Ferrone and G.a. De Biase and A. Massini}, title = {An O(log2 N) Depth Asymptotically Nonblocking SelfRouting Permutation Network}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {8}, issn = {00189340}, year = {1995}, pages = {10471051}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.403721}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An O(log2 N) Depth Asymptotically Nonblocking SelfRouting Permutation Network IS  8 SN  00189340 SP1047 EP1051 EPD  10471051 A1  C. Ferrone, A1  G.a. De Biase, A1  A. Massini, PY  1995 KW  Permutation networks KW  selfrouting algorithm KW  blocking probability KW  stack of banyan networks. VL  44 JA  IEEE Transactions on Computers ER   
[1] K.E. Batcher,“Sorting networks and their application,” Proc. Spring Joint Computer Conf., pp. 307314, 1968.
[2] G.A. De Biase,C. Ferrone,, and A. Massini,“A quasinonblocking selfrouting network which routes packetsin log2N time,” Proc. IEEE INFOCOM 93, pp. 1,3751,381, 1993.
[3] R L. Cruz,“The statistical data fork: A class of broadband multichannel switches,” IEEE Trans. Communications, vol. 40, pp. 1,6251,634, 1992
[4] D.V. Huntsberger,Statistical Inference.Boston: Allyn and Bacon Inc., 1967.
[5] D.M. Koppelman and A.Y. Oruç, “A SelfRouting Permutation Network,” J. Parallel and Distributed Computing, vol. 10, no. 10, pp. 140151, Oct. 1990.
[6] C.T. Lea,“Bipartite graph design principle for photonic switching systems,” IEEE Trans. Communications, vol. 38, pp. 529538, 1990.
[7] C.T. Lea,“Multilog2N networks and their applications inhigh speed electronic and photonic switching systems,” IEEE Trans. Communications, vol. 38, pp. 1,7401,749, 1990.
[8] C.T. Lea and D.J. Shyy,“Tradeoff of horizontal decomposition versus vertical stackingin rearrangeable nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 899904, 1991.
[9] R. Melen,“A general class of rearrangeable interconnection networks,” IEEE Trans. Communications, vol. 39, pp. 1,7371,739, 1991.
[10] D.J. Shyy and C.T. Lea,“Log2(N,m,p) strictly nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 1,5021,510, 1991.
[11] T.H. Szymansky and V.C. Hamacher,“On the permutation capability of multistage interconnection networks,” IEEE Trans. Computers, vol. 36, pp. 810822, 1987.
[12] T.H. Szymansky and V.C. Hamacher,“On the universality of multipath multistageinterconnection networks,” J. Parallel and Distributed Computing, vol. 7, pp. 541569, 1989.