Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Communications of the ACM - Special section on computer architecture
Journal of the ACM (JACM)
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
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A new approach to processor allocation and task migration in an N-cube multiprocessor
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems
IEEE Transactions on Computers
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Reliable broadcast algorithms for HARTS
ACM Transactions on Computer Systems (TOCS)
Delivery of time-critical messages using a multiple copy approach
ACM Transactions on Computer Systems (TOCS)
Evaluation of a fault tolerant distributed broadcast algorithm in hypercube multicomputers
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
Probabilistic diagnosis of multiprocessor systems
ACM Computing Surveys (CSUR)
Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes
IEEE Transactions on Computers
On General Results for All-to-All Broadcast
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Tree Communication Scheme for Hypercube Systems
IEEE Transactions on Computers
Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults
IEEE Transactions on Computers
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
All-to-All Broadcasting in Faulty Hypercubes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
IEEE Transactions on Parallel and Distributed Systems
All-To-All Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Adaptive and Deadlock-Free Routing for Irregular Faulty Patterns in Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Incorporation of Optimal Timeouts into Distributed Real-Time Load Sharing
IEEE Transactions on Computers
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
A Coordinated Location Policy for Load Sharing in Hypercube-Connected Multicomputers
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers
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
Improved One-to-All Broadcasting Algorithms on Faulty SIMD Hypercubes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Reliable broadcasting in product networks with Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Research note: Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes
Journal of Parallel and Distributed Computing
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Calibrating embedded protocols on asynchronous systems
Information Sciences: an International Journal
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks
Computer Communications
An efficient parallel construction of optimal independent spanning trees on hypercubes
Journal of Parallel and Distributed Computing
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
| Hi-index | 15.02 |
A simple algorithm for broadcasting in a hypercube multicomputer containing faulty nodes/links is proposed. The algorithm delivers multiple copies of the broadcast message through disjoint paths to all the modes in the system. Its salient feature is that the delivery of the multiple copies is transparent to the processes receiving the message and does not require the processes to know the identity of the faulty processors. The processes on nonfaulty nodes that receive the message identify the original message from the multiple copies using some scheme appropriate for the fault model used. The algorithm completes in n+1 steps if each node can simultaneously use all of its outgoing links. If each node cannot use more than one outgoing link at a time, then the algorithm requires 2n steps.