Abstract
The present paper proposes a new parallel ordering, ”block red-black ordering,” for a parallelized ICCG solver with fewer synchronization points and a high convergence rate. In the new method, nodes in an analyzed grid are divided into several or many blocks, and red-black ordering is applied to the blocks. Several blocks are assigned to each processor and the substitution is carried out in parallel. Only one synchronization point exists in each parallelized substitution. We performed an analytical investigation using the ordering graph theory and computational tests on a scalar parallel computer. These results show that a convergence rate is improved by an increase in the number of nodes of one block and that a high parallel performance is attained by using an appropriate block size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Meijerink and H. A. van der Vorst, “An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix Is a Symmetric M-matrix,” Mathematics of Computation, vol. 31, (1977), pp. 148–162.
H. A. van der Vorst and T. F. Chan, “Parallel preconditioning for sparse linear equations,” ZAMM. Z. angew. Math. Mech., 76, (1996), pp. 167–170.
I. S. Duff and H. A. van der Vorst, “Developments and trend in the parallel solution of linear systems,” Parallel Computing, 25, (1999), pp. 1931–1970.
I. S. Duff and G. A. Meurant, “The effect of ordering on preconditioned conjugate gradients, BIT, 29, (1989), pp. 635–657.
S. Doi and T. Washio, “Ordering strategies and related techniques to overcome the trade-off between parallelism and convergence in incomplete factorization”, Parallel Computing, 25, (1999), pp. 1995–2014.
S. Doi and A. Lichnewsky, “A graph-theory approach for analyzing the effects of ordering on ILU preconditioning,” INRIA report 1452, (1991).
T. Iwashita and M. Shimasaki, “Construction and Ordering of Edge Elements for Parallel Computation,” IEEE Trans. Magn., vol. 37, (2001), pp. 3498–3502.
T. Washio and K. Hayami, “Overlapped multicolor MILU Preconditioning,” SIAM Journal of Scientific Computing, 16, (1995), pp. 636–650.
T. Osoda, K. Maruyama, T. Washio, S. Doi and S. Yamada, “Vectorization and parallelization technique of block ILU preconditioning for unstructural problems,” IPSJ Trans. HPS, vol. 41, (2000), pp. 92–99 (in Japanese).
R. Barrett, et al., “Templates for the solution of linear systems: building blocks for iterative methods,” SIAM, (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwashita, T., Shimasaki, M. (2002). Block Red-Black Ordering Method for Parallel Processing of ICCG Solver. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_16
Download citation
DOI: https://doi.org/10.1007/3-540-47847-7_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43674-4
Online ISBN: 978-3-540-47847-8
eBook Packages: Springer Book Archive