FLY. A parallel tree N-body code for cosmological simulations

被引:10
作者
Antonuccio-Delogu, V
Becciani, U
Ferro, D
机构
[1] Osserv Astrofis Catania, I-95123 Catania, Italy
[2] Dipartimento Fis & Astron, I-95123 Catania, Italy
关键词
tree N-body code; parallel computing; cosmological simulations;
D O I
10.1016/S0010-4655(03)00345-X
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
FLY is a parallel treecode which makes heavy use of the one-sided communication paradigm to handle the management of the tree structure. In its public version the code implements the equations for cosmological evolution, and can be run for different cosmological models. This reference guide describes the actual implementation of the algorithms of the public version of FLY, and suggests how to modify them to implement other types of equations (for instance, the Newtonian ones). Title of program: FLY Catalogue identifier: ADSC Program summary URL: http://cpc.cs.qub.ac.uk/summaries/ADSC Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer for which the program is designed and others on which it has been tested: Cray T3E, Sgi Origin 3000, IBM SP Operating systems or monitors under which the program has been tested: Unicos 2.0.5.40, Irix 6.5.14, Aix 4.3.3 Programming language used: Fortran 90, C Memory required to execute with typical data: about 100 Mwords with 2 million-particles Number of bits in a word: 32 Number of processors used: parallel program. The user can select the number of processors greater than or equal to 1 Has the code been vectorized or parallelized?: parallelized Number of bytes in distributed program, including test data, etc.: 4 615 604 Distribution format: tar gzip file Keywords: Parallel tree N-body code for cosmological simulations Nature of physical problem: FLY is a parallel collisionless N-body code for the calculation of the gravitational force. Method of solution: It is based on the hierarchical oct-tree domain decomposition introduced by Barnes and Hut (1986). Restrictions on the complexity of the program: The program uses the leapfrog integrator schema, but could be changed by the user. Typical running time: 50 seconds for each time-step, running a 2-million-particles simulation on an Sgi Origin 3800 system with 8 processors having 512 Mbytes RAM for each processor. Unusual features of the program: FLY uses the one-side communications libraries: the SHMEM library on the Cray T3E system and, Sgi Origin system, and the LAPI library on IBM SP system @ 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:159 / 179
页数:21
相关论文
共 11 条
[1]   A HIERARCHICAL O(N-LOG-N) FORCE-CALCULATION ALGORITHM [J].
BARNES, J ;
HUT, P .
NATURE, 1986, 324 (6096) :446-449
[2]   ERROR ANALYSIS OF A TREE CODE [J].
BARNES, JE ;
HUT, P .
ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 1989, 70 (02) :389-417
[3]   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
[4]  
BECCIANI U, 2002, UNPUB FLY 2 1 USER G
[5]  
Bertschinger E., 1995, ASTROPH9506070
[6]  
CARROLL SM, 2000, ASTROPH0004075
[7]   NUMERICAL TECHNIQUES FOR LARGE COSMOLOGICAL N-BODY SIMULATIONS [J].
EFSTATHIOU, G ;
DAVIS, M ;
FRENK, CS ;
WHITE, SDM .
ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 1985, 57 (02) :241-260
[8]  
GROOM DE, 2000, EUR PHYS J C, V15
[9]   PERFORMANCE-CHARACTERISTICS OF TREE CODES [J].
HERNQUIST, L .
ASTROPHYSICAL JOURNAL SUPPLEMENT SERIES, 1987, 64 (04) :715-734
[10]  
KLYPIN Y, 1997, ASTROPH9712217