By Topic

Accelerating the Near Non-bonded Force Computation in Desmond with Graphic Processing Units

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hualiang Deng ; Nankai-Baidu Joint Lab., Nankai Univ., Tianjin, China ; Xin Li ; Jing Liu ; Gang Wang

Desmond is a high-performance program for molecular dynamics simulations (MDS). It provides an unprecedented combination of parallel scalability, simulation speed, and scientific accuracy. However, it still has much improvement space based on the fact that the computation of near non-bonded force (NNF) consumes most of the simulation time. NNF computation is the bottleneck of Desmond. In this paper, we address this problem with graphics processing units (GPU). To the authors' knowledge, this is the first try of accelerating Desmond with GPU. We propose two task decomposition approaches on different levels to accelerate the NNF computation on GPU, one pair-based and another more efficient particle-based. We employ several techniques to optimize the GPU NNF algorithm. Among these techniques, NNF updating conflicts reduction improves the performance best. Combining all the approaches and techniques, we obtain a final speedup of more than 10 on NNF computation and more than 3 on the whole Desmond.

Published in:

Parallel Processing Workshops (ICPPW), 2011 40th International Conference on

Date of Conference:

13-16 Sept. 2011