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.
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.
; Yin ZH(尹兆华)
Edit Comment