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

DOI10.1109/TC.1984.1676393zbMath0546.68028MaRDI QIDQ3336691

Dennis Gannon, John Van Rosendale

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsinterconnection networksnumerical softwareshared memory multiprocessorsparallel architecturesalgorithm performancesystem performancecommunication network designVLSI complexitycost of data movement in parallel numerical algorithmshighly parallel nonshared memory MIMD systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (9)

Communication complexity of the Gaussian elimination algorithm on multiprocessors ⋮ Local uniform mesh refinement on loosely-coupled parallel processors ⋮ Tridiagonalization of band symmetric matrices for vector computers ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Parallel direct methods for solving banded linear systems ⋮ Solving elliptic partial differential equations on the hypercube multiprocessor ⋮ Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision ⋮ Complexity of dense-linear-system solution on a multiprocessor ring

This page was built for publication: On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms