Efficient communication algorithms for pipeline multicomputers

Authors:
Kok Kin Kee;Salim Hariri
Affiliations:
Syracuse University, Syracuse, New York;Syracuse University, Syracuse, New York
Venue:
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Year:
1994

Citing 10
Cited 0

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Optimal communication algorithms for hypercubes

Journal of Parallel and Distributed Computing
Experimental performance evaluation of the CM-5

Journal of Parallel and Distributed Computing - Special issue on performance of supercomputers
Massively parallel methods for engineering and science problems

Communications of the ACM
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing

Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing
Optimal Broadcasting in Mesh-Connected Architectures

Optimal Broadcasting in Mesh-Connected Architectures
Flowchart techniques for structured programming

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the various communication algorithms on the pipeline multicomputer. We show how the three important communication functions (data distribution, data collection, and data broadcast) can be improved by reducing the propagation delay and using the right message size.