Report · 1993 · Open access

Fast parallel algorithms for short-range molecular dynamics

Sandia National Labs., Albuquerque, NM (United States), Steven J. Plimpton, USDOE, Washington, DC (United States)

OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Published 1 May 1993 · DOI 10.2172/10176421

Read the free full textView at the publisherCite this paper

In brief

“Fast parallel algorithms for short-range molecular dynamics” is a 1993 report by Sandia National Labs., Albuquerque, NM (United States) and 2 co-authors, published in OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). OpenAlex counts 389 citations as of 16 November 2026. It is open access: the full text is free to read at OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information).

Citations
389
Most cited in
2020 (118)
Authors
3

Abstract

Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a subset of atoms; the second assigns each a subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently -- those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 10,000,000 atoms on three parallel supercomputers, the nCUBE 2, Intel iPSC/860, and Intel Delta. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and the Intel Delta performs about 30 times faster than a single Y-MP processor and 12 times faster than a single C90 processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

States), S. N. L. A. N., Plimpton, S. J., & States), U. W. D. (1993). Fast parallel algorithms for short-range molecular dynamics. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). https://doi.org/10.2172/10176421

MLA 9

States), Sandia National Labs., Albuquerque, NM (United, et al. “Fast parallel algorithms for short-range molecular dynamics.” OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information), 1993. https://doi.org/10.2172/10176421.

Chicago

States), Sandia National Labs., Albuquerque, NM (United, Steven J. Plimpton, and USDOE, Washington, DC (United States). 1993. “Fast parallel algorithms for short-range molecular dynamics.” OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). https://doi.org/10.2172/10176421.

Harvard

States), S. N. L. A. N., Plimpton, S. J. and States), U. W. D. (1993) ‘Fast parallel algorithms for short-range molecular dynamics’, OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). doi:10.2172/10176421.

IEEE

S. N. L. A. N. States), S. J. Plimpton, and U. W. D. States), “Fast parallel algorithms for short-range molecular dynamics,” OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information), 1993, doi: 10.2172/10176421.

BibTeX

@article{states1993fast,
  title     = {{Fast parallel algorithms for short-range molecular dynamics}},
  author    = {States), Sandia National Labs., Albuquerque, NM (United and Plimpton, Steven J. and States), USDOE, Washington, DC (United},
  journal   = {OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)},
  year      = {1993},
  doi       = {10.2172/10176421},
  url       = {https://doi.org/10.2172/10176421}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201755
201822
20191212
2020118118
2021116116
20223737
20231717
20241919
20251515
20261212

Topic and keywords

Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques

  • parallel algorithms
  • molecular dynamics
  • short-range forces
  • distributed memory parallel computing
  • message passing
  • Lennard-Jones system
  • load balancing
  • spatial partitioning

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

States), S. N. L. A. N., Plimpton, S. J., & States), U. W. D. (1993). Fast parallel algorithms for short-range molecular dynamics. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). https://doi.org/10.2172/10176421

How many times has this paper been cited?

389 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information).

Who wrote this paper?

Sandia National Labs., Albuquerque, NM (United States), Steven J. Plimpton, USDOE, Washington, DC (United States).

What is the DOI of this paper?

10.2172/10176421. The permanent link is https://doi.org/10.2172/10176421.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.