Improving Linpack Performance on SMP Clusters with Asynchronous MPI Programming
Search this article
Abstract
This study proposes asynchronous MPI a simple and effective parallel programming model for SMP clusters to reimplement the High PerformanceLinpack benchmark. The proposed model forces processors of an SMP node to work in different phases thereby avoiding unneccessary communication and computation bottlenecks. As a result we can achieve significant improvements in performance with a minimal programming effort. In comparison with a de-facto flat MPI solution our algorithm can yield a 20.6% performance improvement for a 16-node cluster of Xeon dual-processor SMPs.
This study proposes asynchronous MPI, a simple and effective parallel programming model for SMP clusters, to reimplement the High PerformanceLinpack benchmark. The proposed model forces processors of an SMP node to work in different phases, thereby avoiding unneccessary communication and computation bottlenecks. As a result, we can achieve significant improvements in performance with a minimal programming effort. In comparison with a de-facto flat MPI solution, our algorithm can yield a 20.6% performance improvement for a 16-node cluster of Xeon dual-processor SMPs.
Journal
-
- 情報処理学会論文誌コンピューティングシステム（ACS）
-
情報処理学会論文誌コンピューティングシステム（ACS） 47 (SIG12(ACS15)), 340-348, 2006-09-15
東京 : 情報処理学会
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1050001337893152896
-
- NII Article ID
- 110004782252
-
- NII Book ID
- AA11833852
-
- ISSN
- 18827829
- 03875806
-
- NDL BIB ID
- 8515928
-
- Text Lang
- en
-
- Article Type
- article
-
- Data Source
-
- IRDB
- NDL
- CiNii Articles