Implementing O(N) N-Body Algorithms Efficiently in Data-Parallel Languages

Scientific Programming

Volumn 5, Issue 4, 1996, Pages 337-364

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

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040503522     PISSN: 10589244     EISSN: None     Source Type: Journal    
DOI: 10.1155/1996/425936     Document Type: Article

References (38)

1. Thinking Machines Corporation. CM Fortran Reference Manual, Version 2.1. Thinking Machines Corp. 1993.
2. High Performance Fortran Forum, “High Performance Fortran language specification,” Sci. Prog., vol. 2. pp. 1–170, 1993.
3. J. M. Anderson and M. S. Lam, “Global optimizations for parallelism and locality on scalable parallel machines,”’ in Proc. ACM SIGPLAN 93 Conference on Programming Languages Design and Implementation, 1993.
4. J. Li and M. Chen, “Generating explicit communication from shared-memory program references,” in Proc. Supercomputing 90, 1990.
5. M. E. Wolf and M. S. Lam, “A data locality optimizing algorithm,” in Proc. ACM SIGPLAN ’91 Conference on Programming Languages Design and Implementation. 1991.
6. Thinking Machines Corporation, CM-5 Technical Summary, Thinking Machines Corp., 1991.
7. C. R. Anderson, “An implementation of the fast multipole method without multipoles,” SIAM J. Sci. Stat. Comp. Vol. 13, pp. 923–947. July 1992
8. L. Greengard and V. Rokhlin, “A fast algorithm for particle simulations,” J Comput. Physics, Vol. 73, pp. 325–348, 1987.
9. L. Greengard and W. D. Gropp, “A parallel version of the fast multipole method,” in Parallel Processing for Scientific Computing. SIAM. 1989, pp.213–222.
10. F. Zhao, “An O(N) algorithm for three-dimensional N-body simulations,” AI Memo 995, AI Lab. MIT, Oct. 1987.
11. K. Nabors and J. White, “Fastcap: A multipole accelerated 3-d capacitance extraction program.” Boston, MA, MIT Department of Electrical Engineering and Computer Science, Tech. Rep., 1991.
12. Thinking Machines Corporation, CMSSL for CM Fortran, Version 3.1. Thinking Machines Corp. 1993.
13. R. G. Brickner, personal communication.
14. J. K. Salmon, “Parallel hierarchical N-body methods,” California Institute of Technology, Tech. Rep. CRPC-90-14, 1990.
15. M. Warren and J. Salmon, “Astrophvsical N-bodv simulations using hierarchical tree data structures,” in Proc. Supercomputing ’92, 1992.
16. M. Warren and J. Salmon, “A parallel hashed octtree N-body algorithm,” in Proc. Supercomputing ’93. 1993.
17. P. Liu and S. N. Bhatt, “Experiences with parallel N-body simulation.” in Proc. 6th Annual ACM Symposium on Parallel Algorithms and Architecture. 1994.
18. P. Liu, “The parallel implementation of N-body algorithms,” PhD thesis. Yale University, 1994.
19. F. Zhao and S. L. Johnsson, “The parallel multipole method on the Connection Machine,” SIAM J. Stat. Sci. Comp., Vol. 12, pp. 1420–1437. 1991.
20. J. F. Leathrum, “The parallel fast multipole method in three dimensions,” PhD thesis. Duke University. 1992.
21. J. A. Board, Jr., Z. S. Hakura, W. D. Elliott, D. C. Gray, W. J. Blanke, and J. F. Leathrum Jr., “Scalable implementations of multipole-accelerated algorithms for molecular dynamics,” in Proc. Scalable High Performance Computing Conf. SHPCC94. 1994.
22. W. D. Elliott and J. A. Board, “Fast Fourier transform accelerated fast multipole algorithm,” Department of Electrical Engineering, Duke University. Tech. Rep.94-001, 1994.
23. L. Greengard and V. Rokhlin, “On the efficient implementation of the fast multipole method,” Department of Computer Science, Yale University, New Haven, CT, Tech. Rep. YALEU/DCS/RR-602, Feb. 1988.
24. r., Vol. 63, pp. 1223–1235, 1991.
25. J. P. Singh, C. Holt, T. Ttsuka, A. Gupta, and J. U. Hennessey, “Load balancing and data locality in hierarchical N-bodv methods,” Stanford University. Tech. Rep. CSL-TR-92-505, 1992.
26. J. P. Singh, C. Holt, J. L. Hennessey, and A. Gupta, “A parallel adaptive fast multipole method.” in Proc. Supercomputing ’93, pp. 54–65.
27. U. S. Nvland, J. F. Prins, and J. H. Reif, “A data-parallel implementation of the adaptive fast multipole algorithm,” in Proc. DAGS ’93 Symposium, 1993.
28. J. Barnes and P. Hut, “A hierarchical O(N log N) force calculation algorithm,” Nature, Vol. 324, pp. 446–449, 1986.
29. L. Greengard and V. Rokhlin, “Rapid evaluation of potential fields in three dimensions,” Department of Computer Science, Yale University, New Haven, CT. Tech, Rep. YALEU/DCS/RR-515. Feb. 1987.
30. Y. Hu and S. L. Johnsson, “On the error in Anderson’s fast N-bodv algorithm,” Harvard Universitv, Division of Applied Sciences, Tech. Rep., 1995.
31. J. Katzenelson, “Computational structure of the N-bodv problem,” SIAM J. Sci. Statist. Comput. Vol. 4, pp. 787–815, 1989.
32. J. H. Applegate, M. R. Douglas, Y. Gursel, P. Hunter, C. L. Seitz, and G. J. Sussman, “A digital orrerv, IEEE Trans. Comput., Vol. C-34, pp. 822–832, Sept. 1985.
33. J. J. Dongarra, J. D. Croz, I. Duff, and S. Hammarling, “A set of level 3 basic linear algebra subprograms,” Argonne National Laboratories, Mathematics and Computer Science Division, Tech. Rep. Reprint No. 1, Aug. 1988.
34. J. J. Dongarra, J. Du Croz, S. Hammarling, and R. J. Hanson, “An extended set of Fortran basic linear algebra subprograms,” Argonne National Laboratories, Mathematics and Computer Science Division, Tech. Rep. Technical Memorandum 41, Nov. 1986.
35. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, “Basic linear algebra subprograms for Fortran usage,” ACM TOMS. Vol. 5, pp. 308–323, Sept. 1979.
36. S. L. Johnsson and C.-T. Ho, “Spanning graphs for optimum broadcasting and personalized communication in hypercubes,” IEEE Trans. Comput.. Vol. 38, pp. 1249–1268, Sept. 1989.
37. Y. Hu and S. L. Johnsson, “A data parallel implementation of hierarchical yV-body methods,” Int. J. Supercomput. Appl., Vol. 10, 1996.
38. J. L. Hennessy and D. A. Patterson, “Computer Architecture: A Quantative Approach,” San Mateo, CA: Morgan Kaufmann Publishers Inc., 1990.