Efficient parallel solutions of linear algebraic circuits

Yosi Ben-Asher; Gady Haber

doi:10.1145/305619.305644

Efficient parallel solutions of linear algebraic circuits

Yosi Ben-Asher, Gady Haber

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

The problem of obtaining efficient solutions for parallel evaluation of linear algebraic circuits (LAC) is considered. The parallelism is obtained through matrix multiplications. A CREW PRAM algorithm is used, in which, during execution, propagates computed values into future matrix products, and uses a special scheduling of the matrix multiplications to reduce constant factors of the execution times.

Original language	English
Pages	212-221
Number of pages	10
DOIs	https://doi.org/10.1145/305619.305644
State	Published - 1999
Event	Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 - Saint-Malo Duration: 27 Jun 1999 → 30 Jun 1999

Conference

Conference	Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99
City	Saint-Malo
Period	27/06/99 → 30/06/99

ASJC Scopus subject areas

Software
Safety, Risk, Reliability and Quality

Access to Document

10.1145/305619.305644

Cite this

@conference{0ac65d3a4fa84eabbcf1ffb306f79986,

title = "Efficient parallel solutions of linear algebraic circuits",

abstract = "The problem of obtaining efficient solutions for parallel evaluation of linear algebraic circuits (LAC) is considered. The parallelism is obtained through matrix multiplications. A CREW PRAM algorithm is used, in which, during execution, propagates computed values into future matrix products, and uses a special scheduling of the matrix multiplications to reduce constant factors of the execution times.",

author = "Yosi Ben-Asher and Gady Haber",

year = "1999",

doi = "10.1145/305619.305644",

language = "English",

pages = "212--221",

note = "Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99 ; Conference date: 27-06-1999 Through 30-06-1999",

}

TY - CONF

T1 - Efficient parallel solutions of linear algebraic circuits

AU - Ben-Asher, Yosi

AU - Haber, Gady

PY - 1999

Y1 - 1999

N2 - The problem of obtaining efficient solutions for parallel evaluation of linear algebraic circuits (LAC) is considered. The parallelism is obtained through matrix multiplications. A CREW PRAM algorithm is used, in which, during execution, propagates computed values into future matrix products, and uses a special scheduling of the matrix multiplications to reduce constant factors of the execution times.

AB - The problem of obtaining efficient solutions for parallel evaluation of linear algebraic circuits (LAC) is considered. The parallelism is obtained through matrix multiplications. A CREW PRAM algorithm is used, in which, during execution, propagates computed values into future matrix products, and uses a special scheduling of the matrix multiplications to reduce constant factors of the execution times.

UR - https://www.scopus.com/pages/publications/0032683121

U2 - 10.1145/305619.305644

DO - 10.1145/305619.305644

M3 - Paper

AN - SCOPUS:0032683121

SP - 212

EP - 221

T2 - Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99

Y2 - 27 June 1999 through 30 June 1999

ER -

Efficient parallel solutions of linear algebraic circuits

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this