Keywords
Parallel computingComputer scienceBenchmark (surveying)Parallel algorithmIntel iPSCAlgorithmRange (aeronautics)Molecular dynamicsSupercomputerNode (physics)Computational sciencePhysics
Affiliated Institutions
Related Publications
A new optimizer using particle swarm theory
The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently develope...
A parallel graph decomposition algorithm for DNA sequencing with nanopores
Abstract Motivation: With the potential availability of nanopore devices that can sense the bases of translocating single-stranded DNA (ssDNA), it is likely that ‘reads’ of leng...
AMBERCUBE MD, parallelization of Amber's molecular dynamics module for distributed‐memory hypercube computers
Abstract A fully functional parallel version of the molecular dynamics (MD) module of AMBER3a has been implemented. Procedures parallelized include the calculation of the long‐r...
Particle swarm optimization
The base isolation design usually used the historical well-known earthquake records as an input ground motion. Through the adjustment on each variables of the structure system, ...
Fast Image Super-Resolution Based on In-Place Example Regression
We propose a fast regression model for practical single image super-resolution based on in-place examples, by leveraging two fundamental super-resolution approaches- learning fr...
Publication Info
- Year
- 1995
- Type
- article
- Volume
- 117
- Issue
- 1
- Pages
- 1-19
- Citations
- 42789
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
42789
OpenAlex
Cite This
Steven J. Plimpton
(1995).
Fast Parallel Algorithms for Short-Range Molecular Dynamics.
Journal of Computational Physics
, 117
(1)
, 1-19.
https://doi.org/10.1006/jcph.1995.1039
Identifiers
- DOI
- 10.1006/jcph.1995.1039