A Scalable FPGA Design for Cloud N-Body Simulation
Authors:
- 1 July 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
The N-Body simulation process describes the evolution of a system of forces composed of N bodies, which may represent celestial objects, molecules, and so on. The most accurate algorithm for N-Body simulation, the All-Pairs method, is particularly compute intensive and software implementations on CPUs are inefficient in terms of performance and power consumption. An implementation on a hardware accelerator, such as an FPGA, would benefits in both these terms, exploiting a parallel execution at a relative low power profile. Moreover, it would also benefit faster methods with lower computational complexity, since many of them rely on the All-Pairs approach to approximate the calculation of forces. This work proposes a highly scalable, power efficient and high performance hardware architecture for the N-Body All-Pairs simulation problem. Our final implementation is able to scale up to systems with an arbitrary number of bodies thanks to a tiling approach that allows performance in the order of 13,441 MPairs/s, outperforming state of the art implementations on FPGA in terms of both pure performance, as well as performance per watt ratio. Finally, our design results to be more power efficient than Grape-8 ASIC.Keywords
This publication has 15 references indexed in Scilit:
- A highly scalable and efficient parallel design of N-body simulation on FPGA2017
- An Accelerating Solution for-Body MOND Simulation with FPGA-SoCInternational Journal of Reconfigurable Computing, 2016
- RP-Ring: A Heterogeneous Multi-FPGA Accelerating Solution for N-Body Simulations2016
- A sparse octree gravitational N-body code that runs entirely on the GPU processorJournal of Computational Physics, 2012
- Molecular Dynamics Machine: Special-Purpose Computer for Molecular Dynamics SimulationsMolecular Simulation, 1999
- N-body problems: IES3: Efficient electrostatic and electromagnetic simulationIEEE Computational Science and Engineering, 1998
- A new version of the Fast Multipole Method for the Laplace equation in three dimensionsActa Numerica, 1997
- Speeding up N-body Calculations on Machines without Hardware Square RootScientific Programming, 1992
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986