The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We present a distributed network-level algorithm that constructs a cycle in a <it>d</it>-ary De Bruijn multiprocessor network in the presence of an arbitrary number of node failures. When the number of faults <it>f</it> does not exceed <it>d</it>− 1 a cycle of length at least <it>d</it><super><it>n</it></super>−<it>nf</it>− 1 can always be found in <it>O</it>(<it>n</it>) steps in a network of size <it>d</it><super><it>n</it></super>.</p>
De Bruijn sequences, fault tolerance, Hamiltonian cycles, interconnection networks.

B. Bose and R. A. Rowley, "Distributed Ring Embedding in Faulty De Bruijn Networks," in IEEE Transactions on Computers, vol. 46, no. , pp. 187-190, 1997.
83 ms
(Ver 3.3 (11022016))