A balanced submatrix merging algorithm for multiprocessor architectures
Copyright policy )A balanced submatrix merging algorithm for multiprocessor architectures
The authors design parallel algorithms for merging two \(k\times n\) (\(k\leq n\)) upper trapezoidal submatrices on a pair of directly connected local- memory processors or two clusters of tightly-coupled processors. It is shown that in both environments the work load is evenly distributed, communication can be well masked by computation, and the optimal speedup may be achieved.
- University of Waterloo Canada
- University of Guelph Canada
Numerical solutions to overdetermined systems, pseudoinverses, Numerical algorithms for specific classes of architectures, multiprocessor machines, Distributed algorithms, large scale least squares computations, parallel algorithms, Givens rotations, merging algorithm
Numerical solutions to overdetermined systems, pseudoinverses, Numerical algorithms for specific classes of architectures, multiprocessor machines, Distributed algorithms, large scale least squares computations, parallel algorithms, Givens rotations, merging algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!