DL_POLY_3 I/O: Analysis, Alternatives, and Future Strategies

Ilian T. Todorovm (), Ian J. Bush and Andrew R. Porter
Additional contact information
Ilian T. Todorovm: STFC Daresbury Laboratory
Ian J. Bush: STFC Daresbury Laboratory
Andrew R. Porter: STFC Daresbury Laboratory

A chapter in Parallel Scientific Computing and Optimization, 2009, pp 125-132 from Springer

Abstract: Abstract The molecular dynamics (MD) method is the only tool to provide detailed information on the time evolution of a molecular system on an atomistic scale. Although novel numerical algorithms and data reorganization approches can speed up the numerical calculations, the actual science of a simulation is contained in the captured frames of the system’s state and simulation data during the evolution. Therefore, an important bottleneck in the scalability and efficiency of any MD software is the I/O speed and reliabilty as data has to be dumped and stored for postmortem analysis. This becomes increasingly more important when simulations scale to many thousands of processors and system sizes increase to many millions of particles. This study outlines the problems associated with I/O when performing large classic MD runs and shows that it is necessary to use parallel I/O methods when studying large systems.

Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-09707-7_11

Ordering information: This item can be ordered from
http://www.springer.com/9780387097077

DOI: 10.1007/978-0-387-09707-7_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().