
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Robert A. Rowley, Bella Bose, "Distributed Ring Embedding in Faulty De Bruijn Networks," IEEE Transactions on Computers, vol. 46, no. 2, pp. 187190, February, 1997.  
BibTex  x  
@article{ 10.1109/12.565593, author = {Robert A. Rowley and Bella Bose}, title = {Distributed Ring Embedding in Faulty De Bruijn Networks}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {2}, issn = {00189340}, year = {1997}, pages = {187190}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.565593}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Distributed Ring Embedding in Faulty De Bruijn Networks IS  2 SN  00189340 SP187 EP190 EPD  187190 A1  Robert A. Rowley, A1  Bella Bose, PY  1997 KW  De Bruijn sequences KW  fault tolerance KW  Hamiltonian cycles KW  interconnection networks. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—We present a distributed networklevel algorithm that constructs a cycle in a
[1] F. Annextein, "FaultTolerance of HypercubeDerivative Networks," Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 179188, 1989.
[2] M. Atallah and U. Vishkin, "Finding Euler Tours in Parallel," J. Systems and Sciences, vol. 29, pp. 330337, 1984.
[3] M. Baumslag, "FaultTolerance Properties of deBruijn and ShuffleExchange Networks," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 556563, 1993.
[4] JC. Bermond and C. Peyrat, "De Bruijn and Kautz Networks: A Competitor for the Hypercube?" Hypercube and Distributed Computers, F. Andréand J.P. Verjus, eds. Holland: Elsevier, 1989.
[5] O. Collins, S. Dolinar, R. McEliece, and F. Pollara, "A VLSI Decomposition of the De Bruijn Graph," J. ACM, vol. 39, pp. 931948, Oct. 1992..
[6] H. Fredricksen, "A Survey of Full Length Nonlinear Shift Register Cycle Algorithms," SIAM Review, vol. 24, pp. 195221, 1982.
[7] L.J. Guibas and A.M. Odlyzko, "Periods in Strings," J. Combinatorial Theory, Series A, vol. 30, pp. 1942, 1981.
[8] M.C. Heydemann, J. Opartney, and D. Sotteau, "Embeddings of Hypercubes and Grids into de Bruijn Graphs," Proc. 1992 Int'l Conf. Parallel Processing vol. III, pp. 2837.
[9] A. Lempel, "mary closed sequences," J. Combinatorial Theory, vol. 10, pp. 253258, 1971.
[10] T. Leighton, B. Maggs, and R. Sitaraman, "On the Fault Tolerance of Some Popular BoundedDegree Networks," Proc. 33rd Symp. Foundations of Computer Science, pp. 542552, Oct. 1992.
[11] A. Louri and H. Sung, "An Efficient 3D Optical Implementation of Binary de Bruijn Networks with Applications to Massively Parallel Computing," Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnections, 1995.
[12] P.T. Nielsen, "A Note on BifixFree Sequences," IEEE Trans. Information Theory, pp. 704706, Sept. 1973.
[13] R.A. Rowley and B. Bose, “FaultTolerant Ring Embedding in deBruijn Networks,” IEEE Trans. Computers, vol. 42, no. 12, pp. 14801486, Dec. 1993.
[14] R. Rowley and B. Bose, "Distributed Ring Embedding in Faulty De Bruijn Networks," Technical Report, Dept. of Computer Science, Oregon State Univ., Corvallis, 1996.
[15] M.R. Samatham and D.K. Pradhan, "The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI," IEEE Trans. Computers, vol. 38, no. 4, pp. 567581, Apr. 1989.
[16] E.J. Schwabe, "Embedding Meshes of Trees into deBruijn Graphs," Information Processing Letters, vol. 43, pp. 237240, 1992.
[17] K.N. Sivarajan and R. Ramaswami, “Lightwave Networks based on de Bruijn Graphs,” IEEE/ACM Trans. Networking, vol. 2, pp. 7079, Feb. 1994.
[18] X. Zhong, S. Rajopadhye, and V. Lo, "Parallel Implementation of DivideandConquer Algorithms on Binary de Bruijn Networks," Proc. Sixth Int'l Parallel Processing Symp., pp. 103107, 1992.