1996
DOI: 10.1007/bfb0030114
|View full text |Cite
|
Sign up to set email alerts
|

Supporting dynamic data and processor repartitioning for irregular applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1997
1997
1998
1998

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…We forced a reconfiguration every 500 iterations. A more thorough discussion of our implementation of reconfigurable CHOLESKY, including detailed performance measurements with several test matrices, can be found in [30].…”
Section: Choleskymentioning
confidence: 99%
“…We forced a reconfiguration every 500 iterations. A more thorough discussion of our implementation of reconfigurable CHOLESKY, including detailed performance measurements with several test matrices, can be found in [30].…”
Section: Choleskymentioning
confidence: 99%
“…In particular, we describe data distribution constructs for irregularly structured data such as those for representing sparse matrices. The work presented here is an extension of our earlier preliminary work that appeared in [24]. We use a parallel version of Cholesky factorization of sparse matrices to demonstrate the suitability and efficiency of our implementation.…”
Section: Introductionmentioning
confidence: 96%