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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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
Title of host publication	Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99
Pages	212-221
Number of pages	10
DOIs	https://doi.org/10.1145/305619.305644
State	Published - 1999
Externally published	Yes
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

@inproceedings{274d34873d9c4a53ac946cb0bd529dbd,

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 = "אנגלית",

pages = "212--221",

booktitle = "Proceedings of the 1999 11th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'99",

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 - GEN

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 - http://www.scopus.com/inward/record.url?scp=0032683121&partnerID=8YFLogxK

U2 - 10.1145/305619.305644

DO - 10.1145/305619.305644

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0032683121

SP - 212

EP - 221

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

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