A data–parallel implementation of O(N) hierarchical N–body methods

Proceedings of the International Conference on Supercomputing

Volumn 1996-November, Issue , 1996, Pages

  Hu, Yu ^a   Lennart Johnsson, S ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b University of Houston   (United States)

Author keywords

Data parallel programming; Hierarchical N body methods; Massively parallel processors; Multipole algorithms; N body simulation

Indexed keywords

EFFICIENCY; PARALLEL PROCESSING SYSTEMS; PARALLEL PROGRAMMING;

ANDERSONS; DATA PARALLEL; DATA-PARALLEL PROGRAMMING; HIERARCHICAL N–BODY METHOD; MASSIVELY PARALLEL PROCESSORS; MULTIPOLE ALGORITHM; MULTIPOLES; N-BODY SIMULATION; PARALLEL IMPLEMENTATIONS; PARTICLES SYSTEM;

HIERARCHICAL SYSTEMS;

EID: 85117297073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUPERC.1996.183510     Document Type: Conference Paper

References (37)

1. C. R. Anderson. An implementation of the fast multipole method without multipoles. SIAM J. Sci. Stat. Comput., 13(4):923–947, July 1992.
2. A. Appel. An efficient program for many–body simulation. SIAM J. Sci. Stat. Comput., 6(1):85–103, 1985.
3. J. H. Applegate, M. R. Douglas, Y. Gursel, P. Hunter, C. L. Seitz, and G. J. Sussman. A digital orrery. IEEE Trans. on Computers, C–34(9):822–831, September 1985.
4. J. Barnes and P. Hut. A hierarchical O (N log N) force calculation algorithm. Nature, 324:446–449, 1986.
5. J. A. Board Jr., Z. S. Hakura, W. D. Elliott, D. C. Gray, W. J. Blanke, and J. Leathrum Jr. Scalable implementations of multipole–accelerated algorithms for molecular dynamics. In Proc. Scalable High Performance Computing Conference SHPCC94. IEEE Computer Society Press, May 1994.
6. J. Carrier, L. Greengard, and V. Rokhlin. A fast adaptive multipole algorithm for particle simulations. SIAM Journal of Scientific and Statistical Computing, July 1988.
7. J. J. Dongarra, J. D. Croz, I. Duff, and S. Hammarling. A Set of Level 3 Basic Linear Algebra Subprograms: Model implementation and test programs. Technical Report Reprint No. 2, Argonne National Laboratories, Mathematics and Computer Science Division, August 1988.
8. J. J. Dongarra, J. D. Croz, S. Hammarling, and R. J. Hanson. An Extended Set of Fortran Basic Linear Algebra Subprograms. Technical Report Technical Memorandum 41, Argonne National Laboratories, Mathematics and Computer Science Division, November 1986.
9. W. D. Elliott and J. A. Board. Fast fourier transform accelerated fast multipole algorithm. Technical Report 94–001, Dept. of Electrical Engineering, Duke Univ., 1994.
10. K. Esselink. The order of Appel’s algorithm. Information Processing Letter, 41:141–147, 1992.
11. K. Esselink. A comparison of algorithms for long range interactions. Technical Report 500.90.200GRA204-IN73916 AMER.94.006, Koninklijke/Shell-Laboratorium, Amsterdam, August 1994.
12. L. Greengard and W. D. Gropp. A parallel version of the fast multipole method. In Parallel Processing for Scientific Computing, pages 213–222. SIAM, Philadelphia, 1989.
13. L. Greengard and V. Rokhlin. A fast algorithm for particle simulation. Journal of Computational Physics, 73:325–348, 1987.
14. L. F. Greengard. The rapid evaluation of potential fields in particle systems. MIT Press, 1988.
15. L. F. Greengard and V. Rokhlin. On the efficient implementation of the fast multipole algorithm. Technical Report YALEU/DCS/RR–602, Dept. of Computer Science, Yale Univ., February 1988.
16. High Performance Fortran Forum. High performance fortran; language specification, version 1.0. Scientific Programming, 2(1 - 2):1–170, 1993.
17. Y. Hu and S. L. Johnsson. A data parallel implementation of hierarchical N –body methods. Technical Report TR–26–94, Harvard University, Division of Applied Sciences, September 1994.
18. Y. Hu and S. L. Johnsson. On the accuracy of Anderson’s fast N–body algorithm. Technical report TR–06-96, Harvard University, Division of Applied Sciences, January 1996.
19. Y. Hu and S. L. Johnsson. A data–parallel adaptive O (N) hierarchical N –body method. Technical report, Harvard University, Division of Applied Sciences, 1996.
20. S. L. Johnsson and C.-T. Ho. Spanning graphs for optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Computers, 38(9):1249–1268, September 1989.
21. J. Katzenelson. Computational structure of the N–body problem. SIAM J. Sci. Statist. Comput., 10(4):787–815, 1989.
22. C. Lawson, R. Hanson, D. Kincaid, and F. Krogh. Algorithm 539: Basic linear algebra subprograms for Fortran usage. ACM Transactions on Mathematical Software, 5(3):324 – 325, March 1988.
23. J. F. Leathrum. The parallel fast multipole method in three dimensions. PhD thesis, Duke University, 1992.
24. P. Liu and S. N. Bhatt. Experiences with parallel N-body simulation. In 6th Annual ACM Symposium on Parallel Algorithms and Architecture, pages 122–131. ACM, 1994.
25. P. S. Lomdahl, P. Tamayo, N. Gronbech-Jensen, and D. M. Beazley. 50 GFlops molecular dynamics on the Connection Machine 5. In Supercomputing’93, pages 520–527. IEEE Computer Society, Los Alamitos, 1993.
26. L. S. Nyland, J. F. Prins, and J. H. Reif. A data–parallel implementation of the adaptive fast multipole algorithm. In Proceedings of the DAGS’93 Symposium. Dartmouth Institute for Advanced Graduated Studies in Parallel Computation, Hanover, NH, 1993.
27. J. K. Salmon. Parallel Hierarchical N –Body Methods. PhD thesis, 1990.
28. K. E. Schmidt and M. A. Lee. Implementing the fast multipole method in three dimensions. J. Stat. Phy., 63(5/6), 1991.
29. J. Singh, J. Hennessey, and A. Gupta. Implications of hierarchical N–body methods for multiprocessor architectures. Technical Report CSL–TR–92–506, Stanford University, 1992.
30. J. Singh, C. Holt, J. Hennessey, and A. Gupta. A parallel adaptive fast multipole method. In Supercomputing ’93, pages 54 – 65. IEEE Computer Society, Los Alamitos, 1993.
31. Thinking Machines Corp. CMSSL for CM Fortran, Version 3.1, 1993.
32. Thinking Machines Corp. CM Fortran Libraries Reference Manual, Version 2.2, 1994.
33. M. Warren and J. Salmon. Astrophysical N–body simulations using hierarchical tree data structures. In Supercomputing’92, pages 570 – 576. IEEE Computer Society, Los Alamitos, 1992.
34. M. Warren and J. Salmon. A parallel hashed oct–tree N–body algorithm. In Supercomputing’93, pages 12 – 21. IEEE Computer Society, Los Alamitos, 1993.
35. M. S. Warren and J. K. Salmon. A portable parallel particle program. Computer Physics Communications, 87, 1995.
36. F. Zhao. An O (N ) algorithm for 3–dimensional N–body simulations. Technical Report AI–TR–995, AI Lab, MIT, 1987.
37. F. Zhao and S. L. Johnsson. The parallel multipole method on the Connection Machine. SIAM Journal of Scientific and Statistical Computing, 12(6):1420–1437, Nov. 1991.