Accession Number:

ADA151970

Title:

Complexity of Dense Linear System Solution on a Multiprocessor Ring.

Descriptive Note:

Research rept.,

Corporate Author:

YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Ipsen,I. C. F.
• Saad,Y.
• Schultz,M. H.

Report Date:

1985-01-01

Pagination or Media Count:

29.0

Abstract:

Different algorithms, based on Gaussian elimination, for the solution of dense linar 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 analysed with respect to their requirements of arithmetic as well as communication times. This paper lays no claims to being either exhaustive or complete. Its objective is to compare a variety of algorithms, which are fairly reasonable to program and to analyse, for the solution of a single problem on a certain class of parallel architectures, thereby leading to a more realistic approach to future algorithm development on multiprocessor machines.

Descriptors:

• *LINEAR SYSTEMS
• *MULTIPROCESSORS
• *EQUATIONS
• MATHEMATICAL MODELS
• ALGORITHMS
• DATA PROCESSING
• INFORMATION TRANSFER
• COMPUTER ARCHITECTURE
• PARALLEL PROCESSING

Subject Categories:

• Theoretical Mathematics
• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE