LESSA: An Array to Solve a Set of Linear Equations

Dilip Sarkar

doi:10.1080/00207168708803572

LESSA: An Array to Solve a Set of Linear Equations

Dilip Sarkar

Research output: Contribution to journal › Article

1 Scopus citations

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	https://doi.org/10.1080/00207168708803572
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

Access to Document

10.1080/00207168708803572

Fingerprint Dive into the research topics of 'LESSA: An Array to Solve a Set of Linear Equations'. Together they form a unique fingerprint.

Cite this

Sarkar, D. (1987). LESSA: An Array to Solve a Set of Linear Equations. International Journal of Computer Mathematics, 21(3-4), 297-309. https://doi.org/10.1080/00207168708803572

@article{a50e81b765f64dd1ac08fc4957ec37fd,

title = "LESSA: An Array to Solve a Set of Linear Equations",

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.",

keywords = "Gaussian elimination, Systolic array, area-time performance, parallel algorithms",

author = "Dilip Sarkar",

year = "1987",

month = jan,

day = "1",

doi = "10.1080/00207168708803572",

language = "English (US)",

volume = "21",

pages = "297--309",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - LESSA

T2 - An Array to Solve a Set of Linear Equations

AU - Sarkar, Dilip

PY - 1987/1/1

Y1 - 1987/1/1

N2 - 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.

AB - 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.

KW - Gaussian elimination

KW - Systolic array

KW - area-time performance

KW - parallel algorithms

UR - http://www.scopus.com/inward/record.url?scp=84943457974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943457974&partnerID=8YFLogxK

U2 - 10.1080/00207168708803572

DO - 10.1080/00207168708803572

M3 - Article

AN - SCOPUS:84943457974

VL - 21

SP - 297

EP - 309

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 3-4

ER -