메뉴 건너뛰기




Volumn 65, Issue 7, 2005, Pages 870-881

Massively parallel implementation of a fast multipole method for distributed memory machines

Author keywords

Molecular dynamics algorithms

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DIFFUSION; FAST FOURIER TRANSFORMS; MOLECULAR DYNAMICS; TOPOLOGY;

EID: 19944419779     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.02.001     Document Type: Article
Times cited : (33)

References (36)
  • 2
    • 21844511115 scopus 로고
    • A renormalization method for the evaluation of lattice sums
    • C.L. Berman, and L. Greengard A renormalization method for the evaluation of lattice sums J. Math. Phys. 35 11 1994 6036 6048
    • (1994) J. Math. Phys. , vol.35 , Issue.11 , pp. 6036-6048
    • Berman, C.L.1    Greengard, L.2
  • 4
    • 19944423836 scopus 로고    scopus 로고
    • Design and analysis of the blue gene/L torus interconnection network
    • (W0312-022), IBM Research Division, December
    • M. Blumrich, et al., Design and analysis of the blue gene/L torus interconnection network, Research Report RC23025 (W0312-022), IBM Research Division, December 2003.
    • (2003) Research Report , vol.RC23025
    • Blumrich, M.1
  • 6
    • 0000362580 scopus 로고    scopus 로고
    • A fast adaptive multipole algorithm in three dimensions
    • H. Cheng, L. Greengard, and V. Rokhlin A fast adaptive multipole algorithm in three dimensions J. Comput. Phys. 155 1999 468 498
    • (1999) J. Comput. Phys. , vol.155 , pp. 468-498
    • Cheng, H.1    Greengard, L.2    Rokhlin, V.3
  • 9
    • 0000948126 scopus 로고    scopus 로고
    • Fast Fourier transform accelerated fast multipole algorithm
    • W.D. Elliott, and J.A. Board Jr. Fast Fourier transform accelerated fast multipole algorithm SIAM J. Sci. Comput. 17 2 1996 398 415
    • (1996) SIAM J. Sci. Comput. , vol.17 , Issue.2 , pp. 398-415
    • Elliott, W.D.1    Board Jr., J.A.2
  • 11
    • 0002897633 scopus 로고
    • A parallel version of the fast multipole method
    • L. Greengard, and W.D. Gropp A parallel version of the fast multipole method Comput. Math. Appl. 20 7 1990 63 71
    • (1990) Comput. Math. Appl. , vol.20 , Issue.7 , pp. 63-71
    • Greengard, L.1    Gropp, W.D.2
  • 12
    • 0000396658 scopus 로고
    • A Fast Algorithm for Particle Simulations
    • L. Greengard, and V. Rokhlin A Fast Algorithm for Particle Simulations J. Comput. Phys. 73 1987 325 348
    • (1987) J. Comput. Phys. , vol.73 , pp. 325-348
    • Greengard, L.1    Rokhlin, V.2
  • 13
    • 0003596496 scopus 로고
    • On the efficient implementation of the fast multipole algorithm
    • Department of Computer Science, Yale University unpublished
    • L. Greengard, V. Rokhlin, On the efficient implementation of the fast multipole algorithm, Technical Report RR-602, Department of Computer Science, Yale University, 1988, unpublished.
    • (1988) Technical Report , vol.RR-602
    • Greengard, L.1    Rokhlin, V.2
  • 14
    • 85011484616 scopus 로고    scopus 로고
    • A new version of the fast multipole method for the Laplace equation in three dimensions
    • L. Greengard, V. Rokhlin, A new version of the fast multipole method for the Laplace equation in three dimensions, Acta Numerica (1997) 229-269.
    • (1997) Acta Numerica , pp. 229-269
    • Greengard, L.1    Rokhlin, V.2
  • 15
    • 0032203448 scopus 로고    scopus 로고
    • An improved fast multipole algorithm for potential fields
    • T. Hrycak, and V. Rokhlin An improved fast multipole algorithm for potential fields SIAM J. Sci. Comput. 19 6 1998 1804 1826
    • (1998) SIAM J. Sci. Comput. , vol.19 , Issue.6 , pp. 1804-1826
    • Hrycak, T.1    Rokhlin, V.2
  • 19
    • 0018518295 scopus 로고
    • Virtual cut-through: A new computer communication switching technique
    • P. Kermani, and L. Kleinrock Virtual cut-through: a new computer communication switching technique Comput. Networks 3 4 1979 267 286
    • (1979) Comput. Networks , vol.3 , Issue.4 , pp. 267-286
    • Kermani, P.1    Kleinrock, L.2
  • 20
    • 13644274031 scopus 로고    scopus 로고
    • Communications overlapping in fast multipole particle dynamics methods
    • J. Kurzak, and B.M. Pettitt Communications overlapping in fast multipole particle dynamics methods J. Comput. Phys. 203 2 2005 731 743
    • (2005) J. Comput. Phys. , vol.203 , Issue.2 , pp. 731-743
    • Kurzak, J.1    Pettitt, B.M.2
  • 21
    • 0030188166 scopus 로고    scopus 로고
    • A multipole-based algorithm for efficient calculation of forces and potentials in macroscopic periodic assemblies of particles
    • C.G. Lambert, T.A. Darden, and J.A. Board Jr. A multipole-based algorithm for efficient calculation of forces and potentials in macroscopic periodic assemblies of particles J. Comput. Phys. 126 1996 274 285
    • (1996) J. Comput. Phys. , vol.126 , pp. 274-285
    • Lambert, C.G.1    Darden, T.A.2    Board Jr., J.A.3
  • 22
    • 0042338563 scopus 로고
    • The parallel fast multipole algorithm in three dimensions
    • Duke University, Department of Electrical Engineering unpublished
    • J.F. Leathrum Jr., J.A. Board Jr., The parallel fast multipole algorithm in three dimensions, Technical Report TR92-001, Duke University, Department of Electrical Engineering, 1992, unpublished.
    • (1992) Technical Report , vol.TR92-001
    • Leathrum Jr., J.F.1    Board Jr., J.A.2
  • 24
    • 0002467378 scopus 로고
    • Fast parallel algorithms for short-range molecular dynamics
    • S. Plimpton Fast parallel algorithms for short-range molecular dynamics J. Comput. Phys. 117 1995 1 19
    • (1995) J. Comput. Phys. , vol.117 , pp. 1-19
    • Plimpton, S.1
  • 28
    • 34249919671 scopus 로고
    • Implementing the fast multipole method in three dimensions
    • K.E. Schmidt, and M.A. Lee Implementing the fast multipole method in three dimensions J. Statist. Phys. 63 1991 1223 1235
    • (1991) J. Statist. Phys. , vol.63 , pp. 1223-1235
    • Schmidt, K.E.1    Lee, M.A.2
  • 29
    • 0031256211 scopus 로고    scopus 로고
    • Multipole Ewald sums for the fast multipole method
    • K.E. Schmidt, and M.A. Lee Multipole Ewald sums for the fast multipole method J. Statist. Phys. 89 1997 411 424
    • (1997) J. Statist. Phys. , vol.89 , pp. 411-424
    • Schmidt, K.E.1    Lee, M.A.2
  • 30
    • 0000002112 scopus 로고    scopus 로고
    • The Cray T3E network: Adaptive routing in a high performance 3D torus
    • August
    • S.L. Scott, G.M. Thorson, The Cray T3E network: adaptive routing in a high performance 3D torus, in: Proceedings of Hot Interconnects IV, August 1996.
    • (1996) Proceedings of Hot Interconnects IV
    • Scott, S.L.1    Thorson, G.M.2
  • 31
    • 0029487474 scopus 로고
    • Parallel implementation of the fast multipole method with periodic boundary conditions
    • J.K. Singer Parallel implementation of the fast multipole method with periodic boundary conditions East-West J. Numer. Math. 3 3 1995 199 216
    • (1995) East-West J. Numer. Math. , vol.3 , Issue.3 , pp. 199-216
    • Singer, J.K.1
  • 34
    • 0043005053 scopus 로고
    • Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity
    • J.P. Singh, C. Holt, T. Totsuka, A. Gupta, and J.L. Hennessy Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity J. Parallel Distrib. Comput. 27 1995 118 141
    • (1995) J. Parallel Distrib. Comput. , vol.27 , pp. 118-141
    • Singh, J.P.1    Holt, C.2    Totsuka, T.3    Gupta, A.4    Hennessy, J.L.5
  • 35
    • 0029309970 scopus 로고
    • Implications of hierarchical N-body methods for multiprocessor architectures
    • J.P. Singh, J.L. Hennessy, and A. Gupta Implications of hierarchical N-body methods for multiprocessor architectures ACM Trans. Comput. Systems 13 2 1995 141 202
    • (1995) ACM Trans. Comput. Systems , vol.13 , Issue.2 , pp. 141-202
    • Singh, J.P.1    Hennessy, J.L.2    Gupta, A.3
  • 36
    • 0000016962 scopus 로고    scopus 로고
    • Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation
    • S. Teng Provably good partitioning and load balancing algorithms for parallel adaptive n-body simulation SIAM J. Sci. Comput. 19 2 1998 635 656
    • (1998) SIAM J. Sci. Comput. , vol.19 , Issue.2 , pp. 635-656
    • Teng, S.1


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