Data-parallel molecular dynamics with neighbor-lists

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We report on a data-parallel classical molecular dynamics algorithm and its implementation on Connection Machines CM-5 and CM-200 using CM-Fortran, a Fortran-90 dialect. A grid-based spatial decomposition of the atomic system is used for parallelization. Our previous algorithm on the CM's calculated all forces in the nearby region. A different algorithm using classical Verlet neighbor lists is more efficient, when implemented on the CM-5 with its indirect addressing hardware. The code has been used for extensive simulations on a 128-node CM-5E, and performance measurements are reported.

Cite

CITATION STYLE

APA

Nielsen, O. H. (1996). Data-parallel molecular dynamics with neighbor-lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1041, pp. 443–449). Springer Verlag. https://doi.org/10.1007/3-540-60902-4_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free