
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Qing Hu, Xiaojun Shen, Weifa Liang, "Optimally Routing LC Permutations on kExtraStage CubeType Networks," IEEE Transactions on Computers, vol. 45, no. 1, pp. 97103, January, 1996.  
BibTex  x  
@article{ 10.1109/12.481490, author = {Qing Hu and Xiaojun Shen and Weifa Liang}, title = {Optimally Routing LC Permutations on kExtraStage CubeType Networks}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {1}, issn = {00189340}, year = {1996}, pages = {97103}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.481490}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimally Routing LC Permutations on kExtraStage CubeType Networks IS  1 SN  00189340 SP97 EP103 EPD  97103 A1  Qing Hu, A1  Xiaojun Shen, A1  Weifa Liang, PY  1996 KW  kextrastage cubetype networks KW  LC permutations KW  multistage interconnection networks KW  optimization problems KW  permutation realization KW  routing. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflictfree paths for all sourcedestination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multistage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network.
[1] C. Wu and T. Feng,"The universality of the shuffleexchange network," IEEE Trans. Computers, vol. 30, pp. 324332, May 1981.
[2] D.P. Agrawal,"Graph theoretical analysis and design of multistage interconnection networks," IEEE Trans. Computers, vol. 32, pp. 637648, July 1983.
[3] C. Wu and T. Feng,"On a class of multistage interconnection networks," IEEE Trans. Computers, vol. 29, pp. 694702, Aug. 1980.
[4] G.B. Adams III and H.J. Siegel,"The extra stage cube: a faulttolerant interconnection network for supersystems," IEEE Trans. Computers, vol. 31, pp. 443454, May 1982.
[5] C.L. Wu,T.Y. Feng, and M.C. Lin,"Star: A local network system for realtime management of imagery data," IEEE Trans. Computers, vol. 31, pp. 923933, Oct. 1982.
[6] I. Gazit and M. Malek,"On the number of permutations performable by extrastage multistage interconnection networks," IEEE Trans. Computers, vol. 38, no. 2, pp. 297302, Feb. 1989.
[7] 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.
[8] D.J. Shyy and C.T. Lea,“Log2(N,m,p) strictly nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 1,5021,510, 1991.
[9] X. Shen,M. Xu, and X. Wang,"An optimal algorithm for permutation admissibility to multistage interconnection networks," IEEE Trans. Computers, vol. 44, no. 4, pp. 604608, Apr. 1995.
[10] X. Shen,"An optimal O(NlgN) algorithm for permutation admissibility to extrastage cubetype networks," IEEE Trans. Computers, vol. 44, no. 9, pp. 1,1441,149, Sept. 1995.
[11] C.J.A. Hsia and C.Y. Chen,"Permutation capability of multistage interconnection networks," Proc. Int'l Conf. Parallel Processing, 1990, pp. I338346.
[12] C.S. Raghavendra and A. Varma,“Faulttolerant multiprocessors with redundantpath interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[13] X. Shen,"Optimal realization of any BPC permutation on kextraetage cubetype networks," IEEE Trans. Computers, vol. 44, no. 5, pp. 714719, May 1995.
[14] A. Sengupta,K. Zemoudeh, and S. Bandyopadhyay,"SelfRouting Algorithms for Strongly Regular Multistage Interconnection Networks," J. Parallel Distributed Computing vol. 14, pp. 187  192, 1992.
[15] C.S. Raghavendra and R.V. Boppana,"On selfrouting in Benes and shuffleexchange networks," IEEE Trans. Computers, vol. 40, no. 9, pp.10571064, Sept. 1991.
[16] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[17] H.J. Siegel, Interconnection Networks for LargeScale Parallel Processing, Second Ed., McGrawHill, New York, 1990.
[18] K. Hoffman and R. Kunze,linear algebra,Englewood Cliffs, NJ: Prentice Hall, 1971.
[19] D. Coppersmith and S. Winograd,"Matrix multiplication via arithmetic progressions," Proc. 19th Ann. Symp. Theory of Computing, pp. 16, 1987.