
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ShingTsaan Huang, S.K. Tripathi, NianShing Chen, YuChee Tseng, "An Efficient Routing Algorithm for Realizing Linear Permutations on p/sup t/ShuffleExchange Networks," IEEE Transactions on Computers, vol. 40, no. 11, pp. 12921298, November, 1991.  
BibTex  x  
@article{ 10.1109/12.102836, author = {ShingTsaan Huang and S.K. Tripathi and NianShing Chen and YuChee Tseng}, title = {An Efficient Routing Algorithm for Realizing Linear Permutations on p/sup t/ShuffleExchange Networks}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {11}, issn = {00189340}, year = {1991}, pages = {12921298}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.102836}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Efficient Routing Algorithm for Realizing Linear Permutations on p/sup t/ShuffleExchange Networks IS  11 SN  00189340 SP1292 EP1298 EPD  12921298 A1  ShingTsaan Huang, A1  S.K. Tripathi, A1  NianShing Chen, A1  YuChee Tseng, PY  1991 KW  shuffle exchange networks; routing algorithm; linear permutations; permutation; linearpermutationclass; switching elements; positive integer number; optimal O(log n) parallel algorithm; nonsingular coefficient matrix; multiprocessor interconnection networks; parallel algorithms. VL  40 JA  IEEE Transactions on Computers ER   
The authors present an efficient routing algorithm for realizing any permutation in LIN (linearpermutationclass) on singlestage shuffleexchange networks with k*k switching elements, where k=p is a prime number. For any positive integer number n there are N=k/sup n/ processors connected by the network. The proposed algorithm can realize LIN in 2n1 passes; it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffleexchange networks with (p/sup t/*p/sup t/) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k<2 is discussed. Further, by using the techniques developed here, the authors present an optimal O(log n) parallel algorithm for solving a set of linear equations with a nonsingular coefficient matrix when the arithmetic is over the finite field GF(p/sup t/).
[1] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Conf., 1968, pp. 307314.
[2] R. Cole and J. Hopcroft, "On edge coloring bipartite graphs,"SIAM J. Comput., vol. 11, no. 3, pp. 540546, Aug. 1982.
[3] L. Csanky, "Fast parallel matrix inversion algorithm,"SIAM J. Comput., vol. 5, no. 4, pp. 618623, Dec. 1976.
[4] 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.
[5] P. M. Flanders, "A unified approach to a class of data movements on an array processor,"IEEE Trans. Comput., vol. C31, pp. 809819, Sept. 1982.
[6] H. N. Gabow, "Using Euler partitions to edge color bipartite multigraphs,"J. Comput. Inform. Sci., vol. 5, no. 4, pp. 345355, 1976.
[7] G. Birkhoff and S. Maclane,A Survey of Modern Algebra. New York: Macmillan, 1977, chs. 8 and 13.
[8] K. Hoffman and R. Kunze,Linear Algebra. Englewood Cliffs, NJ: PrenticeHall, 1971, pp. 2858.
[9] S.T. Huang and S. K. Tripathi, "Finite state model and compatibility theory: New analysis tools for permutation networks,"IEEE Trans. Comput., vol. C35, no. 7, pp. 591601, July 1986.
[10] S. T. Huang and S. K. Tripathi, "Selfrouting technique in perfectshuffle networks using control tags,"IEEE Trans. Comput., vol. C37, pp. 251256, Feb. 1988.
[11] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C24, pp. 11451155, Dec. 1975.
[12] J. Lefant, "Parallel permutations of data: A Benes network control algorithm for frequently used permutations,"IEEE Trans. Comput., vol. C27, pp. 637647, July 1978.
[13] G. F. Lev, N. Pippenger, and L. G. Valiant, "A fast parallel algorithm for routing in permutation networks,"IEEE Trans. Comput., vol. C30, pp. 93100, Feb. 1981.
[14] N. Linial and M. Tarsi, "Interpolation between bases and the shuffle exchange network," Tech. Rep., Dep. Math., Hebrew Univ., Jerusalem, Israel.
[15] D. Nassimi and S. Sahni, "An optimal routing algorithm for meshconnected parallel computer,"J. ACM, vol. 27, pp. 629, Jan. 1980.
[16] D. S. Parker, "Notes on shuffle/exchangetype switching networks,"IEEE Trans. Comput., vol. C29, pp. 213221, Mar. 1980.
[17] M. C. Pease, "The indirect binary ncube microprocessor array,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[18] Y. Shiloach and U. Vishkin, "AnO(logn) parallel connectivity algorithm,"J. Algorithm, vol. 3, pp. 5767, 1982.
[19] D. Steinberg, "Invariant properties of the shuffleexchange and a simplified costeffective version of the Omega network,"IEEE Trans. Comput., vol. C32, pp. 444450, May 1983.
[20] H. S. Stone, "Parallel processing with the perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[21] A. Varma and C.S. Raghavendra, "Rearrangeability of multistage shuffle/exchange networks," inProc. Int. Conf. Comput. Arch., 1987, pp. 154162.
[22] C. Wu and T. Feng, "The universality of the shuffleexchange network,"IEEE Trans. Comput., vol. C30, pp. 324331, May 1981.