
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
W. Liu, T.H. Hildebrandt, R. Cavin, III, "Hamiltonian Cycles in the ShuffleExchange Network," IEEE Transactions on Computers, vol. 38, no. 5, pp. 745750, May, 1989.  
BibTex  x  
@article{ 10.1109/12.24277, author = {W. Liu and T.H. Hildebrandt and R. Cavin, III}, title = {Hamiltonian Cycles in the ShuffleExchange Network}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {5}, issn = {00189340}, year = {1989}, pages = {745750}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.24277}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Hamiltonian Cycles in the ShuffleExchange Network IS  5 SN  00189340 SP745 EP750 EPD  745750 A1  W. Liu, A1  T.H. Hildebrandt, A1  R. Cavin, III, PY  1989 KW  Hamiltonian cycles; shuffleexchange network; parallel processing; optimal embedding; shuffle permutation; faulttolerance; reconfigurability; exact equation; shuffleexchange connected array; spare processors; redundancy; directed graphs; fault tolerant computing; multiprocessor interconnection networks. VL  38 JA  IEEE Transactions on Computers ER   
[1] H. Stone, "Parallel processing with perfect shuffle,"IEEE Trans. Comput., vol. C20, pp. 153161, Feb. 1971.
[2] M. Pease, "The indirect binaryNcube processor,"IEEE Trans. Comput., vol. C26, pp. 458473, May 1977.
[3] D. Parker, "Notes on shuffleexchange type switching networks,"IEEE Trans. Comput., vol. C29, pp. 213221, Mar. 1980.
[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] T. H. Hildebrandt, W.T. Liu, and R. Cavin III, "Matrix decompositions on twodimensional shuffleexchange processors," in review.
[6] W. Liu and G. Mei, "A class of twodimensional problems: Algorithms and architectures," inProc. ICCD86, Oct. 1986, invited paper.
[7] C.L. Wu and T.Y. Feng, "The universality of the shuffleexchange network,"IEEE Trans. Comput., vol. C30, pp. 324332, May 1981.
[8] D. Kleitman, F. T. Leighton, M. Lepley, and G. L. Miller, "New layouts for the shuffle exchange graph," inProc. ACM Symp. Theory Computing, 1981, pp. 278292.
[9] F. Leighton and G. Miller, "Optimal layouts for small shuffleexchange graphs,"J. VLSI, pp. 289299, 1981.
[10] K. Padmanabhan and D. Lawrie, "Faulttolerance schemes in shuffleexchange type interconnection networks," inProc. 12th Symp. Comput. Architecture, 1985.
[11] C. Chen and J. Abraham, "Reconfiguration techniques for shuffleexchange processor arrays," Tech. Rep. 865, Comput. Syst. Group, Coordinated Sci. Lab., Univ. of Illinois at UrbanaChampaign, pp. 16 24 (Jan. 1986).