High performance LU factorization for non-dedicated clusters

This paper describes an implementation of parallel LU factorization. The focus is to achieve high performance on non-dedicated clusters, where the number of available computing resources may be arbitrary and even dynamically changing. We accommodate joining/leaving processes by describing the algorithm in the Phoenix programming model. We achieve high performance in this setting by a combination of techniques including a latency tolerant communication and data partitioning that achieves both load balance and small communication volume for arbitrary and dynamically changing number of processors. We observed 130 GFlops with 128 processes on a 70-node dual 2.4GHz Xeon cluster, at matrix size = 46,080. This performance is comparable to that of the High Performance Linpack (HPL). When cluster nodes are loaded by background processes, our implementation surpasses HPL.

• Type: Conference
• Year: 2004
• Where: CCGRID
• Authors: Toshio Endo, Kenji Kaneda, Kenjiro Taura, Akinori Yonezawa
• Keywords: CCGRID 2004, Distributed And Parallel Computing, Implementation Surpasses Hpl, Latency Tolerant Communication, Parallel Lu Factorization