Exploring SIMD for Molecular Dynamics, Using Intel® Xeon® Processors and Intel® Xeon Phi Coprocessors
Authors:
- Simon J. PennycookSPSimon J. Pennycook
- Chris J. HughesCHChris J. Hughes
- M. SmelyanskiyMSM. Smelyanskiy
- S.A. JarvisSJS.A. Jarvis
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302075,p. 1085-1097
Abstract
We analyse gather-scatter performance bottlenecks in molecular dynamics codes and the challenges that they pose for obtaining benefits from SIMD execution. This analysis informs a number of novel code-level and algorithmic improvements to Sandia's miniMD benchmark, which we demonstrate using three SIMD widths (128-, 256and 512bit). The applicability of these optimisations to wider SIMD is discussed, and we show that the conventional approach of exposing more parallelism through redundant computation is not necessarily best. In single precision, our optimised implementation is up to 5x faster than the original scalar code running on Intel®Xeon®processors with 256-bit SIMD, and adding a single Intel®Xeon Phi™coprocessor provides up to an additional 2x performance increase. These results demonstrate: (i) the importance of effective SIMD utilisation for molecular dynamics codes on current and future hardware; and (ii) the considerable performance increase afforded by the use of Intel®Xeon Phi™coprocessors for highly parallel workloads.Keywords
This publication has 24 references indexed in Scilit:
- Pairwise verlet lists: Combining cell lists and verlet lists to improve memory locality and parallelismJournal of Computational Chemistry, 2011
- Debunking the 100X GPU vs. CPU myth2010
- A simple algorithm to accelerate the computation of non‐bonded interactions in cell‐based molecular dynamics simulationsJournal of Computational Chemistry, 2006
- A Novel Algorithm for Non-Bonded-List Updating in Molecular SimulationsJournal of Computational Biology, 2006
- Faster neighbour list generation using a novel lattice vector representationComputer Physics Communications, 2005
- Improved neighbor list algorithm in molecular simulations using cell decomposition and data sorting methodComputer Physics Communications, 2004
- A fast pairlist‐construction algorithm for molecular simulations under periodic boundary conditionsJournal of Computational Chemistry, 2004
- An improved method for nonbonded list generation: Rapid determination of near‐neighbor pairsJournal of Computational Chemistry, 2002
- Movable hash algorithm for search of the neighbor atoms in molecular dynamics simulationComputational Materials Science, 2002
- Near-neighbor calculations using a modified cell-linked list methodComputer Physics Communications, 1999