Multi-threading and one-sided communication in parallel LU factorization
Dense LU factorization has a high ratio of computation to communication and, as evidenced by the High Performance Linpack (HPL) benchmark, this property makes it scale well on most parallel machines. Nevertheless, the standard algorithm for this problem has non-trivial dependence patterns which limi...
Saved in:
| Published in: | Proceedings of the 2007 ACM/IEEE Conference on Supercomputing pp. 1 - 10 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
10.11.2007
IEEE |
| Series: | ACM Conferences |
| Subjects: | |
| ISBN: | 1595937641, 9781595937643 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

