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.
Yuan L,Guo H,Yin ZH. 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
袁礼,Guo H,&尹兆华.(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
袁礼,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.
; Yin ZH(尹兆华)
修改评论