Multilevel summation of electrostatic potentials using graphics processing units

被引:94
作者
Hardy, David J. [1 ]
Stone, John E. [1 ]
Schulten, Klaus [1 ,2 ]
机构
[1] Univ Illinois, Beckman Inst, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Phys, Urbana, IL 61801 USA
关键词
Multilevel summation; Electrostatics; Molecular dynamics; Molecular modeling; GPU computing; MOLECULAR-DYNAMICS SIMULATIONS; PARTICLE MESH EWALD; ALGORITHM;
D O I
10.1016/j.parco.2008.12.005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Physical and engineering practicalities involved in microprocessor design have resulted in flat performance growth for traditional single-core microprocessors. The urgent need for continuing increases in the performance of scientific applications requires the use of many-core processors and accelerators such as graphics processing units (GPUs). This paper discusses GPU acceleration of the multilevel summation method for computing electrostatic potentials and forces for a system of charged atoms, which is a problem of paramount importance in biomolecular modeling applications. We present and test a new GPU algorithm for the long-range part of the potentials that computes a cutoff pair potential between lattice points, essentially convolving a fixed 3D lattice of "weights" over all sub-cubes of a much larger lattice. The implementation exploits the different memory subsystems provided on the GPU to stream optimally sized data sets through the multiprocessors. We demonstrate for the full multilevel summation calculation speedups of up to 26 using a single GPU and 46 using multiple GPUs, enabling the computation of a high-resolution map of the electrostatic potential for a system of 1.5 million atoms in under 12s. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:164 / 177
页数:14
相关论文
共 34 条
[1]  
*ADV MICR DEV INC, 2007, SUP 2007 C NOV
[2]   General purpose molecular dynamics simulations fully implemented on graphics processing units [J].
Anderson, Joshua A. ;
Lorenz, Chris D. ;
Travesset, A. .
JOURNAL OF COMPUTATIONAL PHYSICS, 2008, 227 (10) :5342-5359
[3]  
[Anonymous], 2007, CUDA COMP UN DEV ARC
[4]  
[Anonymous], SOLVING PROBLEMS CON
[5]  
*APPL COMP INC, 2008, APPL WORLDW DEV C JU
[6]   Inherent speedup limitations in multiple time step/Particle Mesh Ewald algorithms [J].
Barash, D ;
Yang, LJ ;
Qian, XL ;
Schlick, T .
JOURNAL OF COMPUTATIONAL CHEMISTRY, 2003, 24 (01) :77-88
[7]  
Bishop TC, 1997, J COMPUT CHEM, V18, P1785, DOI 10.1002/(SICI)1096-987X(19971115)18:14<1785::AID-JCC7>3.0.CO
[8]  
2-G
[9]   ACCELERATED MOLECULAR-DYNAMICS SIMULATION WITH THE PARALLEL FAST MULTIPOLE ALGORITHM [J].
BOARD, JA ;
CAUSEY, JW ;
LEATHRUM, JF ;
WINDEMUTH, A ;
SCHULTEN, K .
CHEMICAL PHYSICS LETTERS, 1992, 198 (1-2) :89-94
[10]   MULTILEVEL MATRIX MULTIPLICATION AND FAST SOLUTION OF INTEGRAL-EQUATIONS [J].
BRANDT, A ;
LUBRECHT, AA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1990, 90 (02) :348-370