Abstract
A dedicated linear array of simple processors is proposed to solve a set of linear equations. Data structure and algorithm also presented for the array to solve a set of n linear equations in 0(«2+ 3n) time on an array of n processors. The given algorithm is a paralIelization of the Gaussian elimination algorithm. The data input to the array is purely sequential. The algorithm is optimal, within a constant, in its lime and area requirements.
Original language | English (US) |
---|---|
Pages (from-to) | 297-309 |
Number of pages | 13 |
Journal | International Journal of Computer Mathematics |
Volume | 21 |
Issue number | 3-4 |
DOIs | |
State | Published - Jan 1 1987 |
Externally published | Yes |
Keywords
- Gaussian elimination
- Systolic array
- area-time performance
- parallel algorithms
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics