An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor

Authors:
Jai Eun Jang
Affiliations:
Department of Computer Science, Oregon State University, Corvallis, OR
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 11
Cited 0

Optimal clock synchronization

Journal of the ACM (JACM)
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Reliable Broadcast in Hypercube Multicomputers

IEEE Transactions on Computers
Task migration in hypercube multiprocessors

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
A new approach to processor allocation and task migration in an N-cube multiprocessor

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe an optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor. This algorithm takes log2(N)+1 steps to broadcast the message to all other processors. Our broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network non-redundantly.