CSpace  > 计算数学与科学工程计算研究所
On optimal message vector length for block single parallel partition algorithm in a three-dimensional ADI solver
Yuan, Li1,2; Guo, Hong1,2; Yin, Zhaohua3
2009-12-01
发表期刊APPLIED MATHEMATICS AND COMPUTATION
ISSN0096-3003
卷号215期号:7页码:2565-2577
摘要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.
关键词Tridiagonal equation Single parallel partition ADI scheme Message vectorization Optimal message vector length
DOI10.1016/j.amc.2009.08.052
语种英语
资助项目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类目Mathematics, Applied
WOS记录号WOS:000271640200019
出版者ELSEVIER SCIENCE INC
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/7408
专题计算数学与科学工程计算研究所
通讯作者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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yuan, Li]的文章
[Guo, Hong]的文章
[Yin, Zhaohua]的文章
百度学术
百度学术中相似的文章
[Yuan, Li]的文章
[Guo, Hong]的文章
[Yin, Zhaohua]的文章
必应学术
必应学术中相似的文章
[Yuan, Li]的文章
[Guo, Hong]的文章
[Yin, Zhaohua]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。