
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xiaojun Shen, "Optimal Realization of Any BPC Permutation on KExtraStage Omega Networks," IEEE Transactions on Computers, vol. 44, no. 5, pp. 714719, May, 1995.  
BibTex  x  
@article{ 10.1109/12.381960, author = {Xiaojun Shen}, title = {Optimal Realization of Any BPC Permutation on KExtraStage Omega Networks}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {5}, issn = {00189340}, year = {1995}, pages = {714719}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.381960}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Realization of Any BPC Permutation on KExtraStage Omega Networks IS  5 SN  00189340 SP714 EP719 EPD  714719 A1  Xiaojun Shen, PY  1995 KW  BPC permutation KW  conflict graph KW  graph coloring KW  kOmega network KW  permutation realization. VL  44 JA  IEEE Transactions on Computers ER   
[1] C. WuXiaojun ShenMemberIEEE and T. Feng,“The universality of the shuffleexchange network,” IEEE Trans. Computers, vol. 30, pp. 324332, May 1981.
[2] D.P. Agwaral,“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 algorithm for permutation admissibility to extrastagecubetype networks,” to appear in IEEE Trans. Computers.
[11] C.J.A. Hsia and C.Y. Chen,“Permutation capability of multistage interconnection networks,” Proc. Int’l Conf. Parallel Processing, pp. I338346, 1990.
[12] C.S. Raghavendra and A. Varma,“Faulttolerant multiprocessors with redundantpath interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[13] J.P. Hayes,Computer Architecture and Organization, Second Edition, McGrawHill, 1988.
[14] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[15] H.J. Siegel, Interconnection Networks for LargeScale Parallel Processing, Second Ed., McGrawHill, New York, 1990.
[16] A. Abdennadher and T. Feng,“On rearrangeability of OmegaOmega networks,” Proc. 1992 Int’l Conf. Parallel Processing, pp. I159165, 1992.
[17] N. Das,B.B. Bhattacharya,, and J. Dattagupta,“Analysis of conflict graphs in multistage interconnection networks,” Proc. IEEE Region 10 Conf. on Computer and Communication Systems, pp. 175179, Sept. 1990.
[18] Q. Hu,X. Shen,, and W. Liang,“Optimally Routing LC Permutations on kExtraStage CubeTypeNetworks,” to appear in IEEE Trans. Computers.