FPGA-Accelerated Particle-Grid Mapping

Computing the forces derived from long-range electrostatics is a critical application and also a central part of Molecular Dynamics. Part of that computation, the transformation of a charge grid to a potential grid via a 3D FFT, has received some attention recently and has been found to work extremely well on FPGAs. Here we report on the rest of the computation, which consists of two mappings: charges onto a grid and a potential grid onto the particles. These mappings are interesting in their own right as they are far more compute intensive than the FFTs; each is typically done using tricubic interpolation. We believe that these mappings have been studied only once previously for FPGAs and then found to be exorbitantly expensive; i.e., only bicubic would lit on the chip. In the current work we lind that, when using the Altera Arria 10, not only do both mappings lit, but also an appropriately sized 3D FFT. This enables the building of a balanced accelerator for the entire long-range electrostatics computation on a single FPGA. This design scales directly to FPGA clusters. Other contributions include a new mapping scheme based on table lookup and a measure of the utility of the floating point support of the Arria-10.

[1]  Tughrul Arslan,et al.  Mapping Real Time Operating System on Reconfigurable Instruction Cell Based Architectures , 2007 .

[2]  Martin C. Herbordt,et al.  FPGA-Based Multigrid Computation for Molecular Dynamics Simulations , 2007 .

[3]  Martin C. Herbordt,et al.  Application-Specific Memory Interleaving Enables High Performance in FPGA-based Grid Computations , 2006, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[4]  Michela Taufer,et al.  Structural, dynamic, and electrostatic properties of fully hydrated DMPC bilayers from molecular dynamics simulations accelerated with graphical processing units (GPUs) , 2011, J. Comput. Chem..

[5]  Thierry Matthey,et al.  ProtoMol, an object-oriented framework for prototyping novel algorithms for molecular dynamics , 2004, TOMS.

[6]  Laxmikant V. Kalé,et al.  Scalable molecular dynamics with NAMD , 2005, J. Comput. Chem..

[7]  Alan D. George,et al.  Simulative Analysis of a Multidimensional Torus-Based Reconfigurable Cluster for Molecular Dynamics , 2014, 2014 43rd International Conference on Parallel Processing Workshops.

[8]  Benjamin Humphries,et al.  Design of 3D FFTs with FPGA clusters , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).

[9]  T. Darden,et al.  Particle mesh Ewald: An N⋅log(N) method for Ewald sums in large systems , 1993 .

[10]  Sam Lee,et al.  An FPGA Implementation of the Smooth Particle Mesh Ewald Reciprocal Sum Compute Engine (RSCE) , 2005 .

[11]  Robert D. Skeel,et al.  Multiple grid methods for classical molecular dynamics , 2002, J. Comput. Chem..

[12]  Jiayi Sheng,et al.  Towards Low-Latency Communication on FPGA Clusters with 3 D FFT Case Study , 2015 .

[13]  Md. Ashfaquzzaman Khan,et al.  Requirements for FPGA-Centric Molecular Dynamics , 2012 .