Accession Number:

ADA151891

Title:

Communication Complexity of the Gaussian Elimination Algorithm on Multiprocessors.

Descriptive Note:

Research rept.,

Corporate Author:

YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Saad,Y.

Report Date:

1985-01-01

Pagination or Media Count:

19.0

Abstract:

This paper proposes a few lower bounds for communication complexity of the Gaussian Elimination algorithm on multiprocessors. Three types of architectures are considered a bus architecture, a nearest neighbor ring network and a nearest neighbor grid network. Additional keywords Computations, and Grids.

Descriptors:

• *ALGORITHMS
• *MULTIPROCESSORS
• COMPUTATIONS
• GRIDS
• COMPUTER ARCHITECTURE

Subject Categories:

• Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE