Finding Euler tours in parallel
Journal of Computer and System Sciences
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
Finite field for scientists and engineers
Finite field for scientists and engineers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Embedding de Bruijn and shuffle-exchange graphs in five pages (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Computers
On the Number of Disjoint Hamiltonian Cycles in De Bruijn Graphs
On the Number of Disjoint Hamiltonian Cycles in De Bruijn Graphs
De bruijn communications networks.
De bruijn communications networks.
Distributed Ring Embedding in Faulty De Bruijn Networks
IEEE Transactions on Computers
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Bidirectional versus Unidirectional Networks: Cost/Performance Trade-Offs
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Binary de Bruijn on-chip network for a flexible multiprocessor LDPC decoder
Proceedings of the 45th annual Design Automation Conference
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Hamiltonian property on binary recursive networks
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Fault-Free pairwise independent hamiltonian paths on faulty hypercubes
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Embedding of cycles in the faulty hypercube
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Hamiltonicity and Pancyclicity of binary recursive networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 14.99 |
A method of embedding a ring in a d-ary de Bruijn multiprocessor network in the event of multiple node (processor) failures is presented. In particular, the algorithm guarantees that a (2/sup n/-n-1)-node ring will be found in a binary de Bruijn network with a single faulty node, where 2/sup n/ is the total number of nodes in the network. It is also shown that a (d/sup n/-1)-node ring can always be found in the presence of d-1 link failures, when d is a prime power and the network contains d/sup n/ nodes. The latter is accomplished by constructing d-1 edge-disjoint cycles each of length d/sup n/-1. A modification of the graph that allows it to admit a Hamiltonian cycle in the event of d-1 edge failures is also discussed.