Space Filling Curve in Domain Docomposition for Parallel Computing
Space filling curve based on Hilbert Peano function is an excellent linear mapping method and get wide application in many fields.In high performance computing,traditional algorithm for domain decomposition is that the three-dimension space is cut many blocks according the computing nodes.For each dimension,every blocks is computed in one node.In this paper,we compare the eciency and the in uence of the domain decomposition between on a hierarchical orthogonal bisection method and on Hilbert Peano curve in gravitational dynamics.We run different n-body simulations with open source codes Gadget2 and enzo at the same initial condition.We nd the two simulation result is compatible in the power spectrum at the large scale.While at the small scale,the result based on Hilbert Peano curve domain decomposition is more precise than that on bisection method in comparison with the velocity dispersion of subhalos.Finally,we arrive at the conclusion that for the small scale problems,space filling curve on Hilbert Peano is a better choice in domain decomposition.
space filling curve domain decomposition parallel computing Hilbert Peano curve
Xianfeng Ye Xuebing Chi Qiang Li Hongxu Chang
Supercomputing Center, Computer Network Information Center, Chinese Academy of Sciences, Beijing 100 Supercomputing Center, Computer Network Information Center, Chinese Academy of Sciences, Beijing 100
国内会议
张家界
英文
1-4
2012-10-29（万方平台首次上网日期，不代表论文的发表时间）