Transactions of the Japan Society for Computational Engineering and Science
Online ISSN : 1347-8826
ISSN-L : 1344-9443
Distributed Memory Parallel Algorithm for Explicit MPS using ParMETIS
Kohei MUROTANIMasatoshi OOCHIToshimitsu FUJISAWASeiichi KOSHIZUKAShinobu YOSHIMURA
Author information
JOURNAL FREE ACCESS

2012 Volume 2012 Pages 20120012

Details
Abstract
In this research, a new distributed memory parallel algorithm of the explicit MPS (Moving Particle Simulation) method is presented. The analysis region is divided for a distributed memory parallel computation using ParMETIS. Two communication techniques of an overlapping method and a non-overlapping method are estimated by parallel scalability tests. Since we find that load balance is most important for the distributed memory parallel algorithm of the explicit MPS method, we find that the non-overlapping method is more effective than the overlapping method. As a result, we have been able to do the MPS analysis of 268 million particles in 38 seconds per one time step. Performance during large scale simulation is examined by computing tsunami wave run-up on a virtual gulf area using up to 58 million particles.
Content from these authors
© 2012 The Japan Society For Computational Engineering and Science
Previous article Next article
feedback
Top