A data parallel formulation of the barnes-hut method for N−body simulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1947, Issue , 2001, Pages 342-349

  Amor, M ^a   Arguello F ^b   Lopez J ^c   Plata, O ^c   Zapata, E L ^c  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

^c UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BARNES HUTS; DATA DISTRIBUTION; DATA PARALLEL; EFFICIENT POINT; PARALLEL ARRAYS; SPACE-FILLING CURVE; TREE-STRUCTURED;

ARTIFICIAL INTELLIGENCE;

EID: 84957021854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (6)

1. Barnes, J., Hut, P.: A Hierarchical O(N log N) Force-Calculation Algorithm. Nature 324 (Dec. 1986) 446-449.
2. Fonlupt, C., Marquet, P., Dekeyser, J.-L.: Data-Parallel Load Balancing Strategies. J. Parallel Computing 24 (1998) 1665-1684.
3. Hu, Y.C., Johnsson, S.L., Teng, S.-H.: High Performance Fortran for Highly Irregular Problems. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming (PPoPP'97) (Las Vegas, NV, Jun. 1997) 13-24.
4. McCurdy, C., Mellor-Crummey, J.: An Evaluation of Computing Paradigms for N-body Simulations on Distributed Memory Architectures. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming (PPoPP'99) (Atlanta, GA, May 1999) 25-36.
5. Ou, C., Ranka, S., Fox, G.: Fast and Parallel Mapping Algorithms for Irregular Problems. J. of Supercomputing 10 (2) (1996) 119-140.
6. Woo, S.C., Ohara, M., Torrie, E., Singh, J.-P., Gupta, A.: The SPLASH2 Programs: Characterization and Methodological Considerations. ACM/IEEE Int'l. Symp. Computer Architecture (ISCA'95) (Jun. 1995) 24-26.