Optimal Banded Triangular Solvers on k-Dimensional Torus Networks

Eunice E. Santos, Eugene S. Santos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of determining parallel complexity of solving banded triangular linear systems using substitution on a k-dimensional torus network. We present lower bounds on execution time for solving these systems, taking into account communication costs. Furthermore, optimal algorithms are designed.

Original languageEnglish (US)
Title of host publicationProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
EditorsT. Gonzalez
Pages731-736
Number of pages6
Edition2
StatePublished - Dec 1 2003
Externally publishedYes
EventProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems - Marina del Rey, CA, United States
Duration: Nov 3 2003Nov 5 2003

Publication series

NameProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Number2
Volume15

Other

OtherProceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems
Country/TerritoryUnited States
CityMarina del Rey, CA
Period11/3/0311/5/03

Keywords

  • Banded triangular solvers
  • k-dimensional torus networks
  • Linear algebra
  • Parallel algorithms and complexity

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Optimal Banded Triangular Solvers on k-Dimensional Torus Networks'. Together they form a unique fingerprint.

Cite this