1997
DOI: 10.1007/3-540-63697-8_104
|View full text |Cite
|
Sign up to set email alerts
|

Performance of CAP-specified linear algebra algorithms

Abstract: The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to processing elements (PEs). Such algorithms suffer from two drawbacks : they are very sensitive to load imbalances between PEs and they make it difficult to take advantage of pipelining opportunities. This paper describes dynamic versions of linear algebra algorithms, where subtasks (matrix block multiplication, matrix block LU factorizat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1999
1999
2005
2005

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 2 publications
(4 reference statements)
0
1
0
Order By: Relevance
“…Besides the Visible Human Slice Server, CAP has been applied successfully to a number of applications, both in the field of image processing 4 and in the field scientific computing 3,7 . We have shown 3 that the overhead specific to CAP is very low: each token incorporates in addition to its user-defined structure a 24 bytes header.…”
Section: Discussionmentioning
confidence: 99%
“…Besides the Visible Human Slice Server, CAP has been applied successfully to a number of applications, both in the field of image processing 4 and in the field scientific computing 3,7 . We have shown 3 that the overhead specific to CAP is very low: each token incorporates in addition to its user-defined structure a 24 bytes header.…”
Section: Discussionmentioning
confidence: 99%