
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Lee, M. Lu, "New SelfRouting Permutation Networks," IEEE Transactions on Computers, vol. 43, no. 11, pp. 13191323, November, 1994.  
BibTex  x  
@article{ 10.1109/12.324564, author = {S. Lee and M. Lu}, title = {New SelfRouting Permutation Networks}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {11}, issn = {00189340}, year = {1994}, pages = {13191323}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.324564}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  New SelfRouting Permutation Networks IS  11 SN  00189340 SP1319 EP1323 EPD  13191323 A1  S. Lee, A1  M. Lu, PY  1994 KW  network routing; switching networks; multiprocessor interconnection networks; computational complexity; selfadjusting systems; selfrouting permutation networks; BNB SRPN; generalized baseline network; delay time; routing decision; hardware complexity; Benes network . VL  43 JA  IEEE Transactions on Computers ER   
This contribution is focused on selfrouting permutation networks capable of routing all n! permutations of its n inputs to its n outputs without internal conflict. First, a selfrouting permutation network named BNB SRPN is described. The network realizes the selfrouting capability on the structure of the generalized baseline network, a modified model of the original baseline network. The network reduced both the hardware and the delay time compared with other comparable networks by a simple algorithm using 1bit information for the routing decision. The network also has a good hardware regularity. In addition, a costeffective selfrouting network is presented, which is derived from the BNB SRPN. The network's hardware complexity, O(N log N), is the same as that of the Benes network which is not selfrouting. The principle realizing a modular structure is also presented. The modular structure is derived from the principle to localize the routing decision. It is shown that the modular structure results in the reduction of the total delay through the network.
[1] T. Feng, "A survey of interconnection networks," inIEEE Computer, pp. 1227, Dec. 1981.
[2] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[3] W. H. Kautz, K. N. Levitt, and A. Waksman, "Cellular interconnection arrays."IEEE Trans. Comput., vol. C17, pp. 443451, May 1968.
[4] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.
[5] D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network,"IEEE Trans. Comput., vol. C31, pp. 148154, 1982.
[6] K. E. Batcher, "Sorting networks and their applications," inProc. 1968 Spring Joint Comput. Conf., vol. 32, AFIPS, Montvale, NJ, pp. 307314.
[7] D. Koppelman and A. Oruç, "A selfrouting permutation network," inProc. 1989 Int. Conf. on Parallel Processing, 1989, vol. I, pp. 288295.
[8] S. Lee and M. Lu, "BNB selfrouting permutation network," inProc. 1991 Int. Conf. Distrib. Computing Syst., May 1991, pp. 574581.
[9] K. E. Batcher, "The flip network in Staran," inProc. 1976 Int. Conf. Parallel Processing, 1976, pp. 6571.
[10] C. L. Wu and T. Feng, "On a class of multistage interconnection networks."IEEE Trans. Comput., vol. C29, pp. 694702, Aug. 1980.
[11] H. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, no. 2, pp. 153161, Feb. 1971.
[12] C. Wu and T. Feng, "The universality of the shuffleexchange network,"IEEE Trans. Comput., vol. C30, no. 5, pp. 324332, May 1981.
[13] S. Lee, "Selfrouting permutation networks for communications and computer systems," Ph.D. dissertation, Texas A&M Univ., 1991.