Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
All-to-All Broadcasting in Faulty Hypercubes
IEEE Transactions on Computers
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Fault-Tolerant Communication Algorithms in Toroidal Networks
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Nonlockability in Multirings and Hypercubes at Serial Transmission of Data Blocks
Automation and Remote Control
Fault-Tolerant Broadcasting in Wormhole-Routed Torus Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On fault tolerance of 3-dimensional mesh networks
Journal of Computer Science and Technology
Journal of Parallel and Distributed Computing
Probabilistic analysis on mesh network fault tolerance
Journal of Parallel and Distributed Computing
Efficient parallel processing with spin-wave nanoarchitectures
The Journal of Supercomputing
Lower bounds on the connectivity probability for 2-D mesh networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Broadcasting and routing in faulty mesh networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Fault-tolerant communication algorithms for $k$-ary $n$-cubes are introduced. These include: One-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication, and all-to-all personalized communication. Each of these algorithms can tolerate up to $(2n-2)$ node failures provided that $k (2n-2)$ and $k 3$. Extensions of these algorithms with up to $2n-1$ node failures are also described. The communication complexities of the proposed algorithms are derived when wormholeor store and forward packet routing is used.