Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Communications of the ACM - Special section on computer architecture
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
A Distributed Algorithm for Fault Diagnosis in Systems with Soft Failures
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
Routing and broadcasting in faulty hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Fault-tolerant communications in parallel systems
Fault-tolerant communications in parallel systems
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-Tolerant Communication Algorithms in Toroidal Networks
IEEE Transactions on Parallel and Distributed Systems
All-to-All Personalized Communication Algorithms in Chordal Ring Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 2
A flit level simulator for wormhole routing
ACM-SE 38 Proceedings of the 38th annual on Southeast regional conference
Routing to support communication in dependable networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Algorithms for energy-efficient broad- and multi-casting in wireless networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 14.98 |
A new fault-tolerant all-to-all broadcasting algorithm in an n-dimensional hypercube with up to $\left\lfloor {{\textstyle{n \over 2}}} \right\rfloor$ faulty links is given. An extension of this algorithm that can tolerate up to $\left\lfloor {{\textstyle{n \over 2}}} \right\rfloor$ faulty nodes is also described. These algorithms assume a multiport I/O model, meaning each node can send and receive messages from all its adjacent nodes simultaneously. The total time steps taken by the proposed algorithms are near optimal, and they produce a factor of n less traffic than previously known algorithms.