Paper Info
Title
Block Red-Black Ordering Method for Parallel Processing of ICCG Solver
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.
Year
DOI
Venue
2002
10.1007/3-540-47847-7_16
ISHPC
Keywords
Field
DocType
fewer synchronization point,parallelized iccg solver,high parallel performance,iccg solver,high convergence rate,appropriate block size,block red-black,scalar parallel computer,new parallel,block red-black ordering method,new method,convergence rate,parallel processing,graph theory,parallel computer
Conjugate gradient method,Graph theory,Block size,Synchronization,Computer science,Parallel computing,Algorithm,Rate of convergence,Solver,Numerical analysis,Grid
Conference
ISBN
Citations 
PageRank 
3-540-43674-X
2
1.05
References 
Authors
4
2
Name
Order
Citations
PageRank
Takeshi Iwashita13611.07
masaaki shimasaki28428.46