Topological Properties of Hypercubes
IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Message routing in an injured hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Data communication in hypercubes
Journal of Parallel and Distributed Computing
Performance of Fault-Tolerant Diagnostics in the Hypercube Systems
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Optimal matrix transposition of bit reversal on hypercubes: all-to-personalized communication
Journal of Parallel and Distributed Computing
Broadcasting in a hypercube when some calls fail
Information Processing Letters
Broadcasting in DMA-bound bounded degree graphs
Discrete Applied Mathematics - Special double volume: interconnection networks
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
All-to-All Broadcasting in Faulty Hypercubes
IEEE Transactions on Computers
All-To-All Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Communication Algorithms in Toroidal Networks
IEEE Transactions on Parallel and Distributed Systems
On Some Global Operations in Faulty SIMD Hypercubes
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient Routing and Broadcasting in Recursive Interconnection Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Hi-index | 14.99 |
Various algorithms for reliable broadcasting (one-to-all) and gossiping (all-to-all) in faulty n-dimensional hypercube multicomputers are described and analyzed. For a broadcast (resp., a gossiping algorithm), the goal is that each processor receives complete information from the source (resp., from all the other processors) even in the presence of faults. One of the main characteristics of the proposed algorithms is that no information on the identity of the faulty nodes/links is required. Exchanges between processors are realized such that multiple copies of the same message move through disjoint paths. Solutions are proposed for systems which use a store-and-forward model of communication, the cost of the message transfer between two neighboring processors being modeled by the sum of a startup time plus a propagation time. Two cases are studied: (1) when processors can simultaneously communicate with all their neighbors at any time, and (2) when communications can take place with only one neighbor at a given time. The algorithms are asymptotically optimal. Optimal solutions for very short messages are also proposed. The speedup of these broadcasting algorithms over those designed for unitary length messages is about a factor of n. The gossiping algorithms require the minimum possible number of time steps and packet transmissions.