The core of smoothed particle hydrodynamics （SPH） is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth...The core of smoothed particle hydrodynamics （SPH） is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced. Through tested on lid driven cavity flow, it is clear that this method can provide high accuracy. Analysis and experiments have been made on its parallelism, and the results show that this method has better parallelism and with adding processors its accuracy become higher, thus it achieves that efficiency grows in pace with accuracy.展开更多
Efficient communication is important to every parallel algorithm. A parallel communication optimization is introduced into lattice Boltzmann method （LBM）. It relies on a simplified communication strategy which is im...Efficient communication is important to every parallel algorithm. A parallel communication optimization is introduced into lattice Boltzmann method （LBM）. It relies on a simplified communication strategy which is implemented by least square method. After testing the improved algorithm on parallel platform, the experimental results show that compared with normal parallel lattice Boltzmann algorithm, it provides better stability, higher performance while maintaining the same accuracy.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant No.11002086)the Shanghai Leading Academic Discipline Project(Grant No.J50103)
文摘The core of smoothed particle hydrodynamics （SPH） is the nearest neighbor search subroutine. In this paper, a nearest neighbor search algorithm which is based on multiple background grids and support variable smooth length is introduced. Through tested on lid driven cavity flow, it is clear that this method can provide high accuracy. Analysis and experiments have been made on its parallelism, and the results show that this method has better parallelism and with adding processors its accuracy become higher, thus it achieves that efficiency grows in pace with accuracy.
基金Project supported by the National Natural Science Foundation of China(Grant No.11002086)the Shanghai Leading Academic Discipline Project(Grant No.J50103)
文摘Efficient communication is important to every parallel algorithm. A parallel communication optimization is introduced into lattice Boltzmann method （LBM）. It relies on a simplified communication strategy which is implemented by least square method. After testing the improved algorithm on parallel platform, the experimental results show that compared with normal parallel lattice Boltzmann algorithm, it provides better stability, higher performance while maintaining the same accuracy.
