
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.S. Raghavendra, R.V. Boppana, "On SelfRouting in Benes and ShuffleExchange Networks," IEEE Transactions on Computers, vol. 40, no. 9, pp. 10571064, September, 1991.  
BibTex  x  
@article{ 10.1109/12.83649, author = {C.S. Raghavendra and R.V. Boppana}, title = {On SelfRouting in Benes and ShuffleExchange Networks}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {9}, issn = {00189340}, year = {1991}, pages = {10571064}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83649}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On SelfRouting in Benes and ShuffleExchange Networks IS  9 SN  00189340 SP1057 EP1064 EPD  10571064 A1  C.S. Raghavendra, A1  R.V. Boppana, PY  1991 KW  Benes networks; shuffleexchange networks; selfrouting algorithms; network selfrouting; interconnection networks; multiprocessor interconnection networks. VL  40 JA  IEEE Transactions on Computers ER   
The authors present selfrouting algorithms for realizing the class of linear permutations in various multistage networks such as Benes and 2nstage shuffleexchange. Linear permutations are useful in providing fast access of data arrays. In the first half of the network, switches are set by comparing the destination tags at their inputs, and, in the second half, switches are set using the Omega selfrouting algorithm. It is shown that the comparison operations can be implemented in bitserial networks without loss of time. In contrast, with the wellknown Benes network selfrouting algorithm of D. Nassimi and S. Sahni (1981), switches are set by giving priority to the destination tag at the upper input to them. The algorithms presented are useful in providing fast access of various data patterns using interconnection networks cheaper than crossbars.
[1] J. Beetem, M. Denneau, and D. Weingarten, "The GF11 supercomputer," inProc. Int. Symp. Comput. Architecture, 1985, pp. 108115.
[2] V. E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
[3] G. Birhkoff and S. MacLane,A Survey of Modern Algebra, fourth ed. New York: Macmillan, 1977.
[4] R. V. Boppana and C. S. Raghavendra, "Generalized schemes for access and alignment of data in parallel processors with selfrouting interconnection networks,"J. Parallel Distributed Comput., vol. 11, pp. 97111, 1991.
[5] T. Etzion and A. Lempel, "An efficient algorithm for generating linear transformations in a shuffleexchange network,"SIAM J. Comput., vol. 15, no. 1, pp. 216221, Feb. 1986.
[6] K. Hoffman and R. Kunze,Linear Algebra, second ed. Englewood Cliffs, NJ: PrenticeHall, 1971.
[7] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, no. 12, 1975.
[8] J. Lenfant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C27, 1978.
[9] D. Nassimi, "A faulttolerant routing algorithm for BPC permutations on multistage interconnection networks, " inProc. Int. Conf. Parallel Processing, 1989, pp. 278287.
[10] D. Nassimi and S. Sahni, "A selfrouting Benes network and parallel permutation algorithms,"IEEE Trans. Comput., vol. C30, no. 5, 1981.
[11] D. Nassimi and S. Sahni, "Parallel algorithms to set up the Benes permutation network,"IEEE Trans. Comput., vol. C31, pp. 148154, 1982.
[12] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, pp. 213222, 1980.
[13] M.C. Pease, III, "The indirect binaryncube microprocessor array,"IEEE Trans. Comput., vol. C26, 1977.
[14] C. S. Raghavendra and R. V. Boppana, "An analysis of some selfrouting schemes for multistage interconnection networks," Tech. Rep., Dep. EESystems, Univ. of Southern Cal., Univ. Park, Los Angeles, CA 900890781, June 1990.
[15] D. Steinberg, "Invariant properties of the shuffleexchange and a simplified costeffective version of the omega network,"IEEE Trans. Comput., vol. C32, pp. 444450, 1983.
[16] A. Varma and C. S. Raghavendra, "Rearrangeability of multistage shuffle/exchange networks,"IEEE Trans. Commun., vol. COM36, no. 10, 1988.
[17] A. Waksman, "A permutation network,"J. ACM, vol. 15, no. 1, 1968.
[18] P.C. Yew and D. H. Lawrie, "An easily controlled network for frequently used permutations,"IEEE Trans. Comput., vol. C30, no. 4, 1981.