Skip to main navigation Skip to search Skip to main content

Memory-access optimization of parallel molecular dynamics simulation via dynamic data reordering

  • Manaschai Kunaseth
  • , Ken Ichi Nomura
  • , Hikmet Dursun
  • , Rajiv K. Kalia
  • , Aiichiro Nakano
  • , Priya Vashishta

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

Dynamic irregular applications such as molecular dynamics (MD) simulation often suffer considerable performance deterioration during execution. To address this problem, an optimal data-reordering schedule has been developed for runtime memory-access optimization of MD simulations on parallel computers. Analysis of the memory-access penalty during MD simulations shows that the performance improvement from computation and data reordering degrades gradually as data translation lookaside buffer misses increase. We have also found correlations between the performance degradation with physical properties such as the simulated temperature, as well as with computational parameters such as the spatial-decomposition granularity. Based on a performance model and pre-profiling of data fragmentation behaviors, we have developed an optimal runtime data-reordering schedule, thereby archiving speedup of 1.35, 1.36 and 1.28, respectively, for MD simulations of silica at temperatures 300 K, 3,000 K and 6,000 K. © 2012 Springer-Verlag.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages781-792
Number of pages12
Volume7484 LNCS
DOIs
StatePublished - Oct 24 2012
Externally publishedYes

Fingerprint

Dive into the research topics of 'Memory-access optimization of parallel molecular dynamics simulation via dynamic data reordering'. Together they form a unique fingerprint.

Cite this