Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Hierarchical Interconnection Networks for Multicomputer Systems
IEEE Transactions on Computers
An optimized broadcasting technique for WK-Recursive topologies
Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Tightly Connected Hierarchical Interconnection Networks for Parallel Processors
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Fault-Tolerant cycle embedding in the WK-Recursive network
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the NDST-graph. The MP-graph can also be used for message routing in the presence of faulty nodes. Similarly, the EDHP-graph (the NDST-graph) can be used for message broadcast in the presence of faulty links (nodes). Fault-tolerant communication schemes using these graphs have the advantage that no information about the presence or location of faulty components is required. Moreover, the MP-graph and the NDSTgraph can be used under different fault models. We analyze the communication delays for message routing (broadcast) along MP-graphs (EDHP-graphs and NDST-graphs) under fault-free and faulty conditions.