메뉴 건너뛰기




Volumn 11, Issue 12, 2000, Pages 1306-1323

Experiences with parallel N-body simulation

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE TREE STRUCTURE; BARNES-HUT ALGORITHM; COMPUTATIONAL WORK LOAD; PARALLEL N-BODY SIMULATION; PEANO-HILBERT SPACE FILING CURVE; PROGRAMMING COMPLEXITY;

EID: 0034476645     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.895795     Document Type: Article
Times cited : (26)

References (38)
  • 1
  • 4
    • 0000605094 scopus 로고
    • A Modified Tree Code: Don't Laugh; It Runs
    • J. Barnes, "A Modified Tree Code: Don't Laugh; It Runs," J. Computational Physics, vol. 87, 1990.
    • (1990) J. Computational Physics , vol.87
    • Barnes, J.1
  • 5
    • 33846349887 scopus 로고
    • A Hierarchical O(N log N) Force-Calculation Algorithm
    • J. Barnes and P. Hut, "A Hierarchical O(N log N) Force-Calculation Algorithm," Nature, vol. 324, 1986.
    • (1986) Nature , vol.324
    • Barnes, J.1    Hut, P.2
  • 6
    • 0023981296 scopus 로고
    • Heuristics Based on Space-Filling Curves for Combinatorial Problems in Euclidean Space
    • J. Bartholdi and L. Platzman, "Heuristics Based on Space-Filling Curves for Combinatorial Problems in Euclidean Space," Management Science, vol. 34, 1988.
    • (1988) Management Science , vol.34
    • Bartholdi, J.1    Platzman, L.2
  • 7
    • 0024752948 scopus 로고
    • Worst-Case Examples for the Space-Filling Curve Heuristic for the Euclidean Traveling Salesman Problem
    • D. Bertsimas and M. Grigni, "Worst-Case Examples for the Space-Filling Curve Heuristic for the Euclidean Traveling Salesman Problem," Operation Research Letter, vol. 8, 1989.
    • (1989) Operation Research Letter , vol.8
    • Bertsimas, D.1    Grigni, M.2
  • 14
    • 0029239056 scopus 로고
    • A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
    • Jan.
    • P. Callahan and S. Kosaraju, "A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields," J. ACM, vol. 42, no. 1, pp. 67-90, Jan. 1995.
    • (1995) J. ACM , vol.42 , Issue.1 , pp. 67-90
    • Callahan, P.1    Kosaraju, S.2
  • 15
    • 11744296702 scopus 로고
    • Filament Surgery and Temporal Grid Adaptivity Extensions to a Parallel Tree Code for Simulation and Diagnostics in 3D Vortex Dynamics
    • V. Fernadez, N. Zabusky, S. Bhatt, P. Liu, and A. Gerasoulis, "Filament Surgery and Temporal Grid Adaptivity Extensions to a Parallel Tree Code for Simulation and Diagnostics in 3D Vortex Dynamics," Proc. Second Int'l Workshop in Vortex Flow, 1995.
    • (1995) Proc. Second Int'l Workshop in Vortex Flow
    • Fernadez, V.1    Zabusky, N.2    Bhatt, S.3    Liu, P.4    Gerasoulis, A.5
  • 17
    • 0002650462 scopus 로고
    • Numerical Study of a Three-Dimensional Vortex Method
    • O.M. Knio and A.F. Ghoniem, "Numerical Study of a Three-Dimensional Vortex Method," J. Computational Physics, vol. 86, 1980.
    • (1980) J. Computational Physics , vol.86
    • Knio, O.M.1    Ghoniem, A.F.2
  • 22
    • 4544248103 scopus 로고
    • A Data-Parallel Implementation of the Adaptive Fast Multipole Algorithm
    • L. Nyland, J. Prins, and J. Reif, "A Data-Parallel Implementation of the Adaptive Fast Multipole Algorithm," DAGS/PC Symp., 1993.
    • (1993) DAGS/PC Symp.
    • Nyland, L.1    Prins, J.2    Reif, J.3
  • 23
    • 0024750851 scopus 로고
    • Spacefilling Curves and the Planar Traveling Salesman Problem
    • L.K. Platzman and J.J. Bartholdi, "Spacefilling Curves and the Planar Traveling Salesman Problem," J. ACM, 1989.
    • (1989) J. ACM
    • Platzman, L.K.1    Bartholdi, J.J.2
  • 27
    • 28144458231 scopus 로고
    • Skeletons from the Treecode Closet
    • J. Salmon and M. Warren, "Skeletons from the Treecode Closet," J. Computational Physics, vol. 111, no. 1, pp. 136-155, 1994.
    • (1994) J. Computational Physics , vol.111 , Issue.1 , pp. 136-155
    • Salmon, J.1    Warren, M.2
  • 29
    • 0029309970 scopus 로고
    • Implications of Hierarchical N-Body Methods for Multiprocessor Architectures
    • May
    • J. Singh, J. Hennessy, and A. Gupta, "Implications of Hierarchical N-Body Methods for Multiprocessor Architectures," ACM Trans. Computer Systems, vol. 13, no. 2, pp. 141-202, May 1995.
    • (1995) ACM Trans. Computer Systems , vol.13 , Issue.2 , pp. 141-202
    • Singh, J.1    Hennessy, J.2    Gupta, A.3
  • 34
    • 0002554224 scopus 로고
    • Astrophysical N-Body Simulations Using Hierarchical Tree Data Structures
    • M. Warren and J. Salmon, "Astrophysical N-Body Simulations Using Hierarchical Tree Data Structures," Proc. Supercomputing, 1992.
    • (1992) Proc. Supercomputing
    • Warren, M.1    Salmon, J.2
  • 35
  • 37
    • 0001701198 scopus 로고    scopus 로고
    • An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations
    • May
    • G. Xue, "An O(n) Time Hierarchical Tree Algorithm for Computing Force Field in n-Body Simulations," Theoretical Computer Science, vol. 197, nos. 1-2, pp. 157-169, May 1998.
    • (1998) Theoretical Computer Science , vol.197 , Issue.1-2 , pp. 157-169
    • Xue, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.