Domain Decomposition Pcg Methods for Serial and Parallel Processing

Author(s):  
M. Papadrakakis ◽  
S. Bitzarakis
1992 ◽  
Vol 16 (6) ◽  
pp. 497-513 ◽  
Author(s):  
Marc P. Armstrong ◽  
Paul J. Densham

1996 ◽  
Vol 25 (2-3) ◽  
pp. 291-307 ◽  
Author(s):  
M. Papadrakakis ◽  
S. Bitzarakis

2004 ◽  
Vol 2004.57 (0) ◽  
pp. 89-90
Author(s):  
Masao OGINO ◽  
A.M.M. MUKADDES ◽  
Atsushi URAKAMI ◽  
Ryuji SHIOYA ◽  
Hiroshi KANAYAMA

2016 ◽  
Vol 2016 ◽  
pp. 1-5
Author(s):  
Dingju Zhu

Although parallel computing is used in the existing numerical solutions ofN-body problem, tons of communications betweenNparticles render the parallel efficiency extremely low. Despite the fact that domain decomposition based on short-range interaction is used, whenNis exceedingly large and lots of communications exist between particles in adjacent areas, the parallel efficiency remains terribly low. This paper puts forward adjacent zero communication parallel cloud computing method forN-body problem with short-range interaction domain decomposition. According to this method, the adjacent subblock data are exchanged and redundantly stored without acquiring data from other subblocks in the parallel processing, so the waiting time for data transmission can be saved and hence the parallel processing efficiency can be enhanced substantially.


Sign in / Sign up

Export Citation Format

Share Document