
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xiaojun Shen, "An Optimal O(NlgN) Algorithm for Permutation Admissibility to ExtraStage CubeType Networks," IEEE Transactions on Computers, vol. 44, no. 9, pp. 11441149, September, 1995.  
BibTex  x  
@article{ 10.1109/12.464393, author = {Xiaojun Shen}, title = {An Optimal O(NlgN) Algorithm for Permutation Admissibility to ExtraStage CubeType Networks}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {9}, issn = {00189340}, year = {1995}, pages = {11441149}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.464393}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Optimal O(NlgN) Algorithm for Permutation Admissibility to ExtraStage CubeType Networks IS  9 SN  00189340 SP1144 EP1149 EPD  11441149 A1  Xiaojun Shen, PY  1995 KW  Conflict graph KW  extrastage cubetype network KW  lower bound KW  graph coloring KW  permutation admissibility. VL  44 JA  IEEE Transactions on Computers ER   
[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. Computer, 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] 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.
[5] M. Xu and X. Shen,“A new faulttolerant generalized cube with an extra stage,” Proc. Second Int’l Computer Science Conf., Dec. 1992, pp. 99105,Hong Kong.
[6] K.Y. Lee,“On the rearrangeability of 2(lgn)−1 stage permutation networks,” IEEE Trans. Computesr, vol. 34, pp. 412425, May 1985.
[7] D.S. Parker,“Notes on shuffle/exchangetype switching networks,” IEEE Trans. Computers, vol. 29, pp. 213222, Mar. 1980.
[8] M.C. Pease,“The indirect binary ncube microprocessor array,” IEEE Trans. Computers, vol. 26, pp. 458473, May 1977.
[9] 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.
[10] C.J.A. Hsia and C.Y. Chen,“Permutation capability of multistage interconnection networks,” Int’l Conf. Parallel Processing, pp. I338346, 1990.
[11] 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.
[12] D.J. Shyy and C.T. Lea,“Log2(N,m,p) strictly nonblocking networks,” IEEE Trans. Communications, vol. 39, pp. 1,5021,510, 1991.
[13] G.B. Adams III and H.J. Siegel,“The extra stage cube: A faulttolerant interconnection network for supersystems,” IEEE Trans. Computer, vol. C31, pp. 443454, May 1982.
[14] C.S. Raghavendra and A. Varma,“Faulttolerant multiprocessors with redundantpath interconnection networks,” IEEE Trans. Computers, vol. 35, No. 4, Apr. 1986.
[15] S. Baase,Computer Algorithms, Second Edition. Addison Wesley, 1989.
[16] H.J. Siegel, Interconnection Networks for LargeScale Parallel Processing, Second Ed., McGrawHill, New York, 1990.
[17] K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing.New York: McGraw Hill, 1984.
[18] C.L. Wu,T.Y. Feng,, and M.C. Lin,“Star: A local network system for realtime management of imagery data,” IEEE Trans. Computer, vol. 31, pp. 923 933, Oct. 1982.
[19] J.P. Hayes,Computer Architecture and Organization, Second Edition, McGrawHill, 1988.
[20] D.K. Pradhan and K.L. Kodandapani,“A uniform representation of single and multistage interconnection networks used in SIMD machines,” IEEE Trans. Computers, vol. 29, no. 9, pp. 777791, Sept. 1980.