Performance analysis of high-accuracy tree code based on the pseudoparticle multipole method

被引:13
作者
Kawai, A
Makino, J
Ebisuzaki, T
机构
[1] Saitama Inst Technol, Fac Human & Social Studies, Osato, Saitama 3690293, Japan
[2] Univ Tokyo, Sch Sci, Dept Astron, Bunkyo Ku, Tokyo 1130033, Japan
[3] Inst Phys & Chem Res, Sci Computat Lab, Wako, Saitama 3510198, Japan
[4] RIKEN, Wako, Saitama 35101, Japan
关键词
galaxies : kinematics and dynamics; large-scale structure of universe; methods : n-body simulations; methods : numerical;
D O I
10.1086/381391
中图分类号
P1 [天文学];
学科分类号
0704 ;
摘要
In this paper, we describe the performance and accuracy of the (PM2)-M-2 tree code. The (PM2)-M-2 tree code is a high-accuracy tree code based on the pseudoparticle multipole method ((PM2)-M-2). (PM2)-M-2 is a method to express multipole expansion using a small number of pseudoparticles. The potential field of physical particles is approximated by the field generated by the pseudoparticles. The primary advantage of the (PM2)-M-2 tree code is that it can use Gravity Pipe (GRAPE) special-purpose computers efficiently for high-accuracy calculations. Although the tree code has been implemented on GRAPE, it could not handle terms of the multipole expansion higher than dipole, since GRAPE can calculate forces from point mass particles only. Thus, the calculation cost grows quickly when high accuracy is required. In the (PM2)-M-2 tree code, the multipole expansion is expressed by particles, and thus we can evaluate high-order terms on GRAPE. We implemented the (PM2)-M-2 tree code on both MDGRAPE-2 and a conventional workstation and measured the performance. The results show that MDGRAPE-2 accelerates the calculation by a factor between 20 (for low accuracy) and 200 (for high accuracy). Even on general-purpose programmable computers, the (PM2)-M-2 tree code offers the advantage that the mathematical formulae, and therefore the actual program, are much simpler than that of the direct implementation of multipole expansion, although the calculation cost becomes somewhat higher.
引用
收藏
页码:13 / 33
页数:21
相关论文
共 30 条
[1]   AN IMPLEMENTATION OF THE FAST MULTIPOLE METHOD WITHOUT MULTIPOLES [J].
ANDERSON, CR .
SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1992, 13 (04) :923-947
[2]  
[Anonymous], 1998, SCI SIMULATIONS SPEC
[3]  
[Anonymous], 1992, SUPERCOMPUTING 92, DOI DOI 10.1109/SUPERC.1992.236647
[4]   Performance and accuracy of a GRAPE-3 system for collisionless N-body simulations [J].
Athanassoula, E ;
Bosma, A ;
Lambert, JC ;
Makino, J .
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 1998, 293 (04) :369-380
[5]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[6]   A MODIFIED TREE CODE - DONT LAUGH - IT RUNS [J].
BARNES, JE .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 87 (01) :161-170
[7]   ERROR ANALYSIS OF A TREE CODE [J].
BARNES, JE ;
HUT, P .
ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 1989, 70 (02) :389-417
[8]   Are you ready to FLY in the universe?: A multi-platform N-body tree code for parallel supercomputers [J].
Becciani, U ;
Antonuccio-Delogu, V .
COMPUTER PHYSICS COMMUNICATIONS, 2001, 136 (1-2) :54-63
[9]  
BLACKSTON D, 1997, P SC97
[10]  
Chau NH, 2002, 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XVI, PROCEEDINGS, P477