Complexity of dense-linear-system solution on a multiprocessor ring |
| |
Institution: | Research Center for Scientific Computation Yale University P.O. Box 2158, Yale Station New Haven, Connecticut 06520 USA |
| |
Abstract: | Different algorithms, based on Gaussian elimination, for the solution of dense linear systems of equations are discussed for a multiprocessor ring. The number of processors is assumed not to exceed the problem size. A fairly general model for data transfer is proposed, and the algorithms are analyzed with respect to their requirements of arithmetic as well as communication times. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|