4.4. Parallel algorithms — LAMMPS documentation

\(\renewcommand{\AA}{\text{Å}}\)

# 4.4. Parallel algorithms

LAMMPS is designed to enable running simulations in parallel using the MPI parallel communication standard with distributed data via domain decomposition. The parallelization aims to be efficient, and resulting in good strong scaling (= good speedup for the same system) and good weak scaling (= the computational cost of enlarging the system is proportional to the system size). Additional parallelization using GPUs or OpenMP can also be applied within the subdomain assigned to an MPI process. For clarity, most of the following illustrations show the 2d simulation case. The underlying algorithms in those cases, however, apply to both 2d and 3d cases equally well.

Note

The text and most of the figures in this chapter were adapted for the manual from the section on parallel algorithms in the new LAMMPS paper.

- 4.4.1. Partitioning
- 4.4.2. Communication
- 4.4.3. Neighbor lists
- 4.4.4. Long-range interactions
- 4.4.5. OpenMP Parallelism