Abstract

Although molecular dynamics (MD) simulations of biomolecular systems often run for days to months, many events of great scientific interest and pharmaceutical relevance occur on long time scales that remain beyond reach. We present several new algorithms and implementation techniques that significantly accelerate parallel MD simulations compared with current state-of-the-art codes. These include a novel parallel decomposition method and message-passing techniques that reduce communication requirements, as well as novel communication primitives that further reduce communication time. We have also developed numerical techniques that maintain high accuracy while using single precision computation in order to exploit processor-level vector instructions. These methods are embodied in a newly developed MD code called Desmond that achieves unprecedented simulation throughput and parallel scalability on commodity clusters. Our results suggest that Desmond's parallel performance substantially surpasses that of any previously described code. For example, on a standard benchmark, Desmond's performance on a conventional Opteron cluster with 2K processors slightly exceeded the reported performance of IBM's Blue Gene/L machine with 32K processors running its Blue Matter MD code

Keywords

Computer scienceScalabilityParallel computingExploitBenchmark (surveying)Code (set theory)ThroughputIBMMessage passingParallel algorithmMulti-core processorComputationAlgorithmWireless

Affiliated Institutions

Related Publications

Publication Info

Year
2006
Type
article
Pages
43-43
Citations
1611
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1611
OpenAlex

Cite This

K. J. Bowers, David E. Chow, Huafeng Xu et al. (2006). Scalable Algorithms for Molecular Dynamics Simulations on Commodity Clusters. , 43-43. https://doi.org/10.1109/sc.2006.54

Identifiers

DOI
10.1109/sc.2006.54