Zonal methods for the parallel execution of range-limited N-body simulations

doi:10.1016/j.jcp.2006.06.014

Title: Zonal methods for the parallel execution of range-limited N-body simulations

Full Record
Other Related Research

Abstract

Particle simulations in fields ranging from biochemistry to astrophysics require the evaluation of interactions between all pairs of particles separated by less than some fixed interaction radius. The applicability of such simulations is often limited by the time required for calculation, but the use of massive parallelism to accelerate these computations is typically limited by inter-processor communication requirements. Recently, Snir [M. Snir, A note on N-body computations with cutoffs, Theor. Comput. Syst. 37 (2004) 295-318] and Shaw [D.E. Shaw, A fast, scalable method for the parallel evaluation of distance-limited pairwise particle interactions, J. Comput. Chem. 26 (2005) 1318-1328] independently introduced two distinct methods that offer asymptotic reductions in the amount of data transferred between processors. In the present paper, we show that these schemes represent special cases of a more general class of methods, and introduce several new algorithms in this class that offer practical advantages over all previously described methods for a wide range of problem parameters. We also show that several of these algorithms approach an approximate lower bound on inter-processor data transfer.

Authors:

Bowers, Kevin J. ^[1]; Dror, Ron O. ^[1]; Shaw, David E. ^[2]

D. E. Shaw Research, LLC, New York, NY 10036 (United States)
D. E. Shaw Research, LLC, New York, NY 10036 (United States) and Center for Computational Biology and Bioinformatics, Columbia University, New York, NY 10032 (United States). E-mail: david@deshaw.com

Publication Date:: Sat Jan 20 00:00:00 EST 2007

OSTI Identifier:: 20991555

Resource Type:: Journal Article

Resource Relation:: Journal Name: Journal of Computational Physics; Journal Volume: 221; Journal Issue: 1; Other Information: DOI: 10.1016/j.jcp.2006.06.014; PII: S0021-9991(06)00291-9; Copyright (c) 2006 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved; Country of input: International Atomic Energy Agency (IAEA)

Country of Publication:: United States

Language:: English

Subject:: 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; ASTROPHYSICS; BIOCHEMISTRY; EVALUATION; MANY-BODY PROBLEM; MATHEMATICAL MODELS; MOLECULAR DYNAMICS METHOD; PARTICLE INTERACTIONS; SIMULATION

Citation Formats


                    Bowers, Kevin J., Dror, Ron O., and Shaw, David E. Zonal methods for the parallel execution of range-limited N-body simulations.  United States: N. p., 2007. 
        Web.  doi:10.1016/j.jcp.2006.06.014.

Copy to clipboard


                    Bowers, Kevin J., Dror, Ron O., & Shaw, David E. Zonal methods for the parallel execution of range-limited N-body simulations.  United States.  doi:10.1016/j.jcp.2006.06.014.

Copy to clipboard


                    Bowers, Kevin J., Dror, Ron O., and Shaw, David E. Sat .  
        "Zonal methods for the parallel execution of range-limited N-body simulations".  United States.  
        doi:10.1016/j.jcp.2006.06.014.

Copy to clipboard


                    
@article{osti_20991555,

  title        = {Zonal methods for the parallel execution of range-limited N-body simulations},

  author       = {Bowers, Kevin J. and Dror, Ron O. and Shaw, David E.},

  abstractNote = {Particle simulations in fields ranging from biochemistry to astrophysics require the evaluation of interactions between all pairs of particles separated by less than some fixed interaction radius. The applicability of such simulations is often limited by the time required for calculation, but the use of massive parallelism to accelerate these computations is typically limited by inter-processor communication requirements. Recently, Snir [M. Snir, A note on N-body computations with cutoffs, Theor. Comput. Syst. 37 (2004) 295-318] and Shaw [D.E. Shaw, A fast, scalable method for the parallel evaluation of distance-limited pairwise particle interactions, J. Comput. Chem. 26 (2005) 1318-1328] independently introduced two distinct methods that offer asymptotic reductions in the amount of data transferred between processors. In the present paper, we show that these schemes represent special cases of a more general class of methods, and introduce several new algorithms in this class that offer practical advantages over all previously described methods for a wide range of problem parameters. We also show that several of these algorithms approach an approximate lower bound on inter-processor data transfer.},

  doi          = {10.1016/j.jcp.2006.06.014},

  journal      = {Journal of Computational Physics},

  number       = 1,

  volume       = 221,

  place        = {United States},

  year         = {Sat Jan 20 00:00:00 EST 2007},

  month        = {Sat Jan 20 00:00:00 EST 2007}

}

Copy to clipboard

Journal Article:

DOI: 10.1016/j.jcp.2006.06.014

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

K-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical N-body simulations

Journal Article Marzouk, Youssef M. ; Ghoniem, Ahmed F. - Journal of Computational Physics

A number of complex physical problems can be approached through N-body simulation, from fluid flow at high Reynolds number to gravitational astrophysics and molecular dynamics. In all these applications, direct summation is prohibitively expensive for large N and thus hierarchical methods are employed for fast summation. This work introduces new algorithms, based on k-means clustering, for partitioning parallel hierarchical N-body interactions. We demonstrate that the number of particle-cluster interactions and the order at which they are performed are directly affected by partition geometry. Weighted k-means partitions minimize the sum of clusters' second moments and create well-localized domains, and thus reducemore »« less
DOI: 10.1016/j.jcp.2005.01.021
Influence of the parallel nonlinearity on zonal flows and heat transport in global gyrokinetic particle-in-cell simulations

Journal Article Jolliet, S. ; McMillan, B. F. ; Vernay, T. ; ... - Physics of Plasmas

In this paper, the influence of the parallel nonlinearity on zonal flows and heat transport in global particle-in-cell ion-temperature-gradient simulations is studied. Although this term is in theory orders of magnitude smaller than the others, several authors [L. Villard, P. Angelino, A. Bottino et al., Plasma Phys. Contr. Fusion 46, B51 (2004); L. Villard, S. J. Allfrey, A. Bottino et al., Nucl. Fusion 44, 172 (2004); J. C. Kniep, J. N. G. Leboeuf, and V. C. Decyck, Comput. Phys. Commun. 164, 98 (2004); J. Candy, R. E. Waltz, S. E. Parker et al., Phys. Plasmas 13, 074501 (2006)] found differentmore »« less
DOI: 10.1063/1.3174433
Stress Domains in Si(111)/a-Si{sub 3}N{sub 4} Nanopixel: Ten-Million-Atom Molecular Dynamics Simulations on Parallel Computers

Journal Article Omeltchenko, Andrey ; Bachlechner, Martina E. ; Nakano, Aiichiro ; ... - Physical Review Letters

Parallel molecular dynamics simulations are performed to determine atomic-level stresses in Si(111)/Si {sub 3}N{sub 4}(0001) and Si(111)/a-Si {sub 3}N{sub 4} nanopixels. Compared to the crystalline case, the stresses in amorphous Si{sub 3}N {sub 4} are highly inhomogeneous in the plane of the interface. In silicon below the interface, for a 25 nm square mesa stress domains with triangular symmetry are observed, whereas for a rectangular, 54 nmx33 nm , mesa tensile stress domains ({approx}300 Angstrom) are separated by Y-shaped compressive domain wall. Maximum stresses in the domains and domain walls are -2 GPa and +2 GPa , respectively. (c) 2000more » The American Physical Society.« less
DOI: 10.1103/PhysRevLett.84.318
EFFICIENT PARALLEL COMPUTATION OF ALL-PAIRS N-BODY ACCELERATION BY DO-LOOP FOLDING

Journal Article Fukushima, Toshio, E-mail: Toshio.Fukushima@nao.ac.jp - Astronomical Journal (New York, N.Y. Online)

The computational load inside a do loop is equalized by folding the loop appropriately if the amount of load is a linear function of the loop index. Using this idea, we develop an efficient parallel computation scheme of Newtonian all-pairs N-body acceleration vectors with help from OpenMP architecture. Using a consumer PC with a quad-core eight-thread processor, the new parallel scheme runs 4.2-4.9 times faster than a serial computation when the number of particles exceeds a few hundred.
DOI: 10.1088/0004-6256/142/1/18
A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS

Journal Article Pattabiraman, Bharath ; Umbreit, Stefan ; Liao, Wei-keng ; ... - Astrophysical Journal, Supplement Series

We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N {approx} 10{sup 7} particles. Our code is based on the Henon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costsmore »« less
DOI: 10.1088/0067-0049/204/2/15

Similar Records