On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms

Authors:
D. B. Gannon;J. Van Rosendale
Affiliations:
Department of Computer Sciences, Purdue University;-
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 0
Cited 7

Algorithmic Phase Diagrams

IEEE Transactions on Computers
The Effects of Problem Partitioning, Allocation, and Granularity on the Performance of Multiple-Processor Systems

IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers

IEEE Transactions on Computers
Paper: FFTs and three-dimensional Poisson solvers for hypercubes

Parallel Computing
Paper: A method to parallelize tridiagonal solvers

Parallel Computing
The effect of multiprocessor radius on scaling

Parallel Computing
Dynamically adaptive binomial trees for broadcasting in heterogeneous networks of workstations

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science

Quantified Score

Hi-index	14.99

Visualization

Abstract

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.