Communication Complexity of the Gaussian Elimination Algorithm on Multiprocessors.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1985
Accession Number
ADA151891

Entities

People

  • Y. Saad

Organizations

  • Yale University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Arithmetic
  • Arithmetic Units
  • Bandwidth
  • Bus Networks
  • Computations
  • Computer Science
  • Computing System Architectures
  • Data Transmission
  • Differential Equations
  • Elimination
  • Inequalities
  • Linear Systems
  • Multiprocessors
  • Parallel Computing
  • Partial Differential Equations
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Graph Algorithms and Convex Optimization.