This Article 
 Bibliographic References 
 Add to: 
Distributed Ring Embedding in Faulty De Bruijn Networks
February 1997 (vol. 46 no. 2)
pp. 187-190

Abstract—We present a distributed network-level algorithm that constructs a cycle in a d-ary De Bruijn multiprocessor network in the presence of an arbitrary number of node failures. When the number of faults f does not exceed d− 1 a cycle of length at least dnnf− 1 can always be found in O(n) steps in a network of size dn.

[1] F. Annextein, "Fault-Tolerance of Hypercube-Derivative Networks," Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 179-188, 1989.
[2] M. Atallah and U. Vishkin, "Finding Euler Tours in Parallel," J. Systems and Sciences, vol. 29, pp. 330-337, 1984.
[3] M. Baumslag, "Fault-Tolerance Properties of deBruijn and Shuffle-Exchange Networks," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 556-563, 1993.
[4] J-C. 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. 931-948, Oct. 1992..
[6] H. Fredricksen, "A Survey of Full Length Nonlinear Shift Register Cycle Algorithms," SIAM Review, vol. 24, pp. 195-221, 1982.
[7] L.J. Guibas and A.M. Odlyzko, "Periods in Strings," J. Combinatorial Theory, Series A, vol. 30, pp. 19-42, 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. 28-37.
[9] A. Lempel, "m-ary closed sequences," J. Combinatorial Theory, vol. 10, pp. 253-258, 1971.
[10] T. Leighton, B. Maggs, and R. Sitaraman, "On the Fault Tolerance of Some Popular Bounded-Degree Networks," Proc. 33rd Symp. Foundations of Computer Science, pp. 542-552, 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 Bifix-Free Sequences," IEEE Trans. Information Theory, pp. 704-706, Sept. 1973.
[13] R.A. Rowley and B. Bose, “Fault-Tolerant Ring Embedding in deBruijn Networks,” IEEE Trans. Computers, vol. 42, no. 12, pp. 1480-1486, 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. 567-581, Apr. 1989.
[16] E.J. Schwabe, "Embedding Meshes of Trees into deBruijn Graphs," Information Processing Letters, vol. 43, pp. 237-240, 1992.
[17] K.N. Sivarajan and R. Ramaswami, “Lightwave Networks based on de Bruijn Graphs,” IEEE/ACM Trans. Networking, vol. 2, pp. 70-79, Feb. 1994.
[18] X. Zhong, S. Rajopadhye, and V. Lo, "Parallel Implementation of Divide-and-Conquer Algorithms on Binary de Bruijn Networks," Proc. Sixth Int'l Parallel Processing Symp., pp. 103-107, 1992.

Index Terms:
De Bruijn sequences, fault tolerance, Hamiltonian cycles, interconnection networks.
Robert A. Rowley, Bella Bose, "Distributed Ring Embedding in Faulty De Bruijn Networks," IEEE Transactions on Computers, vol. 46, no. 2, pp. 187-190, Feb. 1997, doi:10.1109/12.565593
Usage of this product signifies your acceptance of the Terms of Use.