A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Multi-threading and one-sided communication in parallel LU factorization
2007
Proceedings of the 2007 ACM/IEEE conference on Supercomputing - SC '07
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 limit parallelism, and local computations require large matrices in order to achieve good single processor performance. We present an alternative programming model for this type of problem, which
doi:10.1145/1362622.1362664
dblp:conf/sc/HusbandsY07
fatcat:atejwvvfa5bv3ozdazpe77yt54