On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
文献类型:期刊论文
作者 | Yuan, Li1,2![]() |
刊名 | APPLIED MATHEMATICS AND COMPUTATION
![]() |
出版日期 | 2009-12-01 |
卷号 | 215期号:7页码:2565-2577 |
关键词 | Tridiagonal equation Single parallel partition ADI scheme Message vectorization Optimal message vector length |
ISSN号 | 0096-3003 |
DOI | 10.1016/j.amc.2009.08.052 |
英文摘要 | It has long been recognized that many direct parallel tridiagonal solvers are only efficient for solving a single tridiagonal equation of large sizes, and they become inefficient when naively used in a three-dimensional ADI solver. In order to improve the parallel efficiency of an ADI solver using a direct parallel solver, we implement the single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication costs. The measured performances show that the longest allowable message vector length (MVL) is not necessarily the best choice. To understand this observation and optimize the performance, we propose an improved model that takes the cache effect into consideration. The optimal MVL for achieving the best performance is shown to depend on number of processors and grid sizes. Similar dependence of the optimal MVL is also found for the popular block pipelined method. (C) 2009 Elsevier Inc. All rights reserved. |
资助项目 | Natural Science Foundation of China[G10476032] ; Natural Science Foundation of China[G10531080] ; state key program for developing basic sciences[2005CB321703] ; National Nature Science Foundation of China[G10502054] |
WOS研究方向 | Mathematics |
语种 | 英语 |
WOS记录号 | WOS:000271640200019 |
出版者 | ELSEVIER SCIENCE INC |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/7407] ![]() |
专题 | 计算数学与科学工程计算研究所 |
通讯作者 | Yuan, Li |
作者单位 | 1.Chinese Acad Sci, LSEC, Beijing 100190, Peoples R China 2.Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, Acad Math & Syst Sci, Beijing 100190, Peoples R China 3.Chinese Acad Sci, Inst Mech, Natl Micrograv Lab, Beijing 100190, Peoples R China |
推荐引用方式 GB/T 7714 | Yuan, Li,Guo, Hong,Yin, Zhaohua. On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver[J]. APPLIED MATHEMATICS AND COMPUTATION,2009,215(7):2565-2577. |
APA | Yuan, Li,Guo, Hong,&Yin, Zhaohua.(2009).On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver.APPLIED MATHEMATICS AND COMPUTATION,215(7),2565-2577. |
MLA | Yuan, Li,et al."On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver".APPLIED MATHEMATICS AND COMPUTATION 215.7(2009):2565-2577. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。