A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length | |
Guo H(郭红); Yin ZH(尹兆华); Yuan L(袁礼) | |
Source Publication | Journal of Algorithms & Computational Technology |
2009 | |
Volume | 3Issue:3Pages:229-245 |
Abstract | A parallel strategy for solving multidimensional tridiagonal equations is investigated in this paper. We present in detail an improved version of single parallel partition (SPP) algorithm in conjunction with message vectorization, which aggregates several communication messages into one to reduce the communication cost. We show the resulting block SPP can achieve good speedup for a wide range of message vector length (MVL), especially when the number of grid points in the divided direction is large. Instead of only using the largest possible MVL, we adopt numerical tests and modeling analysis to determine an optimal MVL so that significant improvement in speedup can be obtained. |
Subject Area | 流体力学 |
Indexed By | 其他 |
Language | 英语 |
Document Type | 期刊论文 |
Identifier | http://dspace.imech.ac.cn/handle/311007/28775 |
Collection | 微重力重点实验室 |
Corresponding Author | Yin ZH(尹兆华) |
Recommended Citation GB/T 7714 | Guo H,Yin ZH,Yuan L. A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length[J]. Journal of Algorithms & Computational Technology,2009,3,3,:229-245. |
APA | Guo H,尹兆华,&袁礼.(2009).A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length.Journal of Algorithms & Computational Technology,3(3),229-245. |
MLA | Guo H,et al."A block SPP algorithm for multidimensional tridiagonal equations with optimal message vector length".Journal of Algorithms & Computational Technology 3.3(2009):229-245. |
Files in This Item: | ||||||
File Name/Size | DocType | Version | Access | License | ||
28773.pdf(371KB) | 开放获取 | License | View Application Full Text |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment