会议专题

Parallel FMM algorithm based on space decomposition

In this paper, a parallel computational model and algorithm based on space decomposition is constructed and implemented, which supports the dynamically resource allocation under cluster environment. The major aim is to explore the new space decomposition scheme that can solve computation intensive problem. The fast multipole method (FMM) is an algorithm for rapid evaluation of the potential and force fields in the system involving large numbers of particles. Based on the serial FMM algorithm, a parallel implementation entitled SDPFMM is presented in the paper. The proposed algorithm is characterized by scalability and flexibility. We carried out the experiment on the highperformance computer ZQ3000 with Intel Trace Analyzer and Collector integrated into SDPFMM, and analyzed the experimental data and MPI performance of SDPFMM. The results demonstrate that the proposed algorithm is satisfying in both efficiency and solution quality.

space decomposition FMM SDPFMM MPI ZQ3000 Intel Trace Analyser and Collector

Jinshi Zhu Yongmei lei Jianchen Shan

School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China

国际会议

The Ninth International Conference on Grid and Cloud Computing(第九届网格与云计算国际学术会议 GCC 2010)

南京

英文

168-173

2010-11-01(万方平台首次上网日期,不代表论文的发表时间)