Abstract
We consider the problem of designing optimal and efficient algorithms for solving tridiagonal linear systems with multiple right-hand side vectors on k-dimensional mesh and torus interconnection networks. We derive asymptotic upper and lower bounds for these solvers using odd-even cyclic reduction. We present various important bounds on execution time including general lower bounds which are independent of initial data assignment, and lower bounds based on classifying assignments via the proportion of initial data assigned amongst processors. Finally, different algorithms are designed in order to achieve running times that are within a small constant factor of the lower bounds provided.
Original language | English (US) |
---|---|
Pages (from-to) | 659-672 |
Number of pages | 14 |
Journal | Parallel Processing Letters |
Volume | 13 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2003 |
Externally published | Yes |
Keywords
- Algorithm design and analysis
- Complexity analysis
- Mesh
- Parallel computing
- Torus
- Tridiagonal linear systems
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Hardware and Architecture