Parallel three-dimensional nonequispaced fast fourier transforms and their application to particle simulation

SIAM Journal on Scientific Computing

Volumn 35, Issue 4, 2013, Pages

  Pippig, Michael ^a   Potts, Daniel ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

NFFT; Parallel fast summation; Parallel nonequispaced fast Fourier transform; Parallel particle mesh methods

Indexed keywords

APPROXIMATION ALGORITHMS; CHARGED PARTICLES; DISTRIBUTED COMPUTER SYSTEMS; MEMORY ARCHITECTURE; MESH GENERATION; OPEN SOURCE SOFTWARE; OPEN SYSTEMS; SIGNAL RECEIVERS;

CHARGED PARTICLE SYSTEM; DISTRIBUTED MEMORY ALGORITHMS; DISTRIBUTED MEMORY ARCHITECTURE; FAST SUMMATION; NFFT; NONPERIODIC BOUNDARY CONDITIONS; PARTICLE SIMULATIONS; PARTICLE-MESH METHOD;

FAST FOURIER TRANSFORMS;

EID: 84886844122     PISSN: 10648275     EISSN: 10957200     Source Type: Journal    
DOI: 10.1137/120888478     Document Type: Article

References (59)

1. O. Ayala and L.P. Wang, Parallel implementation and scalability analysis of 3D fast Fourier transform using 2D domain decomposition, Parallel Comput., 39 (2013), pp. 58-77.
2. B.W.H. van Beest and G.J. Kramer, Force fields for silicas and aluminophosphates based on ab initio calculations, Phys. Rev. Lett., 64 (1990), pp. 1955-1958.
3. G. Beylkin, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2 (1995), pp. 363-381.
4. H. Dachsel, M. Hofmann, and G. Rünger, Library support for parallel sorting in scientific computations, in Proceedings of the 13th International Euro-Par Conference, 4641, Lecture Notes in Comput. Sci. 2007, Springer, Berlin, pp. 695-704.
5. M. Deserno and C. Holm, How to mesh up Ewald sums. I. A theoretical and numerical comparison of various particle mesh routines, J. Chem. Phys., 109 (1998), pp. 7678-7693. (Pubitemid 128678339)
6. H.Q. Ding, R.D. Ferraro, and D.B. Gennery, A portable 3d FFT package for distributedmemory parallel architectures, in Proceedings of the 7th SIAM Conference on Parallel Processing for Scientific Computing, SIAM, Philadelphia, 1995, pp. 70-71
7. A.J.W. Duijndam and M. A. Schonewille, Nonuniform fast Fourier transform, Geophysics, 64 (1999), pp. 539-551. (Pubitemid 29388687)
8. A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput., 14 (1993), pp. 1368-1393.
9. H. Eggers, T. Knopp, and D. Potts, Field inhomogeneity correction based on gridding reconstruction, IEEE Trans. Med. Imaging, 26 (2007), pp. 374-384. (Pubitemid 46392345)
10. B. Elbel and G. Steidl, Fast Fourier transform for nonequispaced data, in Approximation Theory IX, C.K. Chui and L.L. Schumaker, eds., Vanderbilt University Press, Nashville, TN, 1998, pp. 39-46.
11. M. Eleftheriou, J.E. Moreira, B.G. Fitch, and R.S. Germain, A volumetric FFT for BlueGene/L, High Performance Computing, Lecture Notes in Comput. Sci. 2913, T.M. Pinkston and V.K. Prasanna, eds., Springer, Berlin, 2003, pp, 194-203.
12. U. Essmann, L. Perera, M.L. Berkowitz, T. Darden, H. Lee, and L.G. Pedersen, A smooth particle mesh Ewald method, J. Chem. Phys., 103 (1995), pp. 8577-8593.
13. P.P. Ewald, Die Berechnung optischer und elektrostatischer Gitterpotentiale, Ann. Phys. (4), 369 (1921), pp. 253-287.
14. B. Fang, Y. Deng, and G. Martyna, Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer, Comput. Phys. Comm., 176 (2007), pp. 531-538. (Pubitemid 46435804)
15. M. Fen and G. Steidl, Fast NFFT based summation of radial functions, Sampl. Theory Signal Image Process., 3 (2004), pp. 1-28.
16. J.A. Fessler and B.P. Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE Trans. Signal Process., 51 (2003), pp. 560-574.
17. K. Fourmont, Non equispaced fast Fourier transforms with applications to tomography, J. Fourier Anal. Appl., 9 (2003), pp. 431-450. (Pubitemid 38156933)
18. M. Frigo and S.G. Johnson, The design and implementation of FFTW3, Proc. IEEE, 93 (2005), pp. 216-231. (Pubitemid 40851223)
19. M. Frigo and S.G. Johnson, FFTW, C Subroutine Library, http://www.fftw.org (2009).
20. L. Greengard and J.-Y. Lee, Accelerating the nonuniform fast Fourier transform, SIAM Rev., 46 (2004), pp. 443-454.
21. M. Griebel, S. Knapek, and G. Zumbusch, Numerical simulation in molecular dynamics, Texts Comput. Sci. Eng. 5, Springer, Berlin, 2007.
22. W. Gropp, E. Lusk, and R. Thakur, Using MPI-2: Advanced Features of the Message- Passing Interface, MIT Press, Cambridge, MA, 1999.
23. F. Hedman and A. Laaksonen, Ewald summation based on nonuniform fast Fourier transform, Chem. Phys. Lett., 425 (2006), pp. 142-147. (Pubitemid 43866661)
24. B. Hess, C. Kutzner, D. van der Spoel, and E. Lindahl, GROMACS 4 : Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation, J. Chem. Theory Comput., 4 (2008), pp. 435-447.
25. R.W. Hockney and J.W. Eastwood, Computer Simulation Using Particles, Taylor&Francis, Bristol, PA, 1988.
26. M. Hofmann and G. Rünger, Fine-grained data distribution operations for particle codes, in Recent Advances in Parallel Virtual Machine and Message Passing Interface, 16th European PVM/MPI Users Group Meeting, Lecture Notes in Comput. Sci. 5659, M. Ropo, J. Westerholm, and J. Dongarra, eds., Springer, 2009, pp. 54-63.
27. J.I. Jackson, C.H. Meyer, D.G. Nishimura, and A. Macovski, Selection of a convolution function for Fourier inversion using gridding, IEEE Trans. Med. Imaging, 10 (1991), pp. 473-478. (Pubitemid 21727988)
28. JuGene: Jülich Blue Gene/P, http://www.fz-juelich.de/ias/jsc/EN/ Expertise/Supercomputers/ JUGENE/JUGENE node.html.
29. I. Kabadshow and H. Dachsel, The error-controlled fast multipole method for open and periodic boundary conditions, in Fast Methods for Long-Range Interactions in Complex Systems, IAS Series 6, G. Sutmann, P. Gibbon, and T. Lippert, eds., Forschungszentrum Jülich, Jülich, 2011, pp. 85-113.
30. J. Keiner, S. Kunis, and D. Potts, NFFT 3.0, C Subroutine Library, http://www.tuchemnitz. de/~potts/nfft.
31. J. Keiner, S. Kunis, and D. Potts, Using NFFT3 - a software library for various nonequispaced fast Fourier transforms, ACM Trans. Math. Software, 36 (2009), pp. 1-30.
32. S. Kunis and S. Kunis, The nonequispaced FFT on graphics processing units, PAMM, 12 (2012), pp. 7-10.
33. S. Kunis and D. Potts, Stability results for scattered data interpolation by trigonometric polynomials, SIAM J. Sci. Comput., 29 (2007), pp. 1403-1419.
34. S. Kunis, D. Potts, and G. Steidl, Fast Gauss transform with complex parameters using NFFTs, J. Numer. Math., 14 (2006), pp. 295-303. (Pubitemid 46110404)
35. N. Li, 2DECOMP&FFT, Parallel FFT Subroutine Library, http://www.2decomp.org.
36. N. Li and S. Laizet, 2DECOMP & FFT - A Highly Scalable 2D Decomposition Library and FFT Interface, Cray User Group 2010 Conference, Edinburgh, Scotland, 2010, pp. 1-13.
37. H.J. Limbach, A. Arnold, B.A. Mann, C. Holm, and G. Berne, ESPResSo - an extensible simulation package for research on soft matter systems, Comput. Phys. Comm., 174 (2006), pp. 704-727.
38. T. MacFarland, H. Couchman, F. Pearce, and J. Pichlmeier, A new parallel code for very large-scale cosmological simulations, New Astron. Rev., 3 (1998), pp. 687-705. (Pubitemid 128467176)
39. MPI Forum, MPI: A Message-Passing Interface Standard. Version 2.2, http://www.mpiforum. org (2009).
40. D. Pekurovsky, P3DFFT, Parallel FFT Subroutine Library, http://code.google. com/p/p3dfft.
41. D. Pekurovsky, P3DFFT: A framework for parallel computations of Fourier transforms in three dimensions, SIAM J. Sci. Comput., 34 (2012), pp. C192-C209.
42. J.C. Phillips, R. Braun, W. Wang, J. Gumbart, E. Tajkhorshid, E. Villa, C. Chipot, R.D. Skeel, L. Kalé, and K. Schulten, Scalable molecular dynamics with NAMD, J. Comput. Chem., 26 (2005), pp. 1781-1802. (Pubitemid 43078511)
43. M. Pippig, PFFT, Parallel FFT Subroutine Library, http://www.tu-chemnitz. de/~mpip/ software.php (2011).
44. M. Pippig, PNFFT, Parallel Nonequispaced FFT Subroutine Library, http://www.tuchemnitz. de/~mpip/software.php (2011).
45. M. Pippig, PFFT: An extension of FFTW to massively parallel architectures, SIAM J. Sci. Comput., 35 (2013), pp. C213-C236.
46. M. Pippig and D. Potts, Particle simulation based on nonequispaced fast Fourier transforms, in Fast Methods for Long-Range Interactions in Complex Systems, IAS Series 6, G. Sutmann, P. Gibbon, and T. Lippert, eds., Forschungszentrum Jülich, Jülich, 2011, pp. 131-158.
47. S.J. Plimpton, Parallel FFT Subroutine Library, http://www.sandia.gov/ ~sjplimp/docs/fft/ README.html.
48. S.J. Plimpton, R. Pollock, and M. Stevens, Particle-mesh Ewald and rRESPA for parallel molecular dynamics simulations, in Proceedings of the 8th SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, 1997, SIAM, Philadelphia, 1997.
49. E. Pollock and J. Glosli, Comments on P3M, FMM, and the Ewald method for large periodic Coulombic systems, Comput. Phys. Comm., 95 (1996), pp. 93-110. (Pubitemid 126362828)
50. D. Potts and G. Steidl, Fast summation at nonequispaced knots by NFFT, SIAM J. Sci. Comput., 24 (2003), pp. 2013-2037.
51. D. Potts, G. Steidl, and A. Nieslony, Fast convolution with radial kernels at nonequispaced knots, Numer. Math., 98 (2004), pp. 329-351. (Pubitemid 39216472)
52. D. Potts, G. Steidl, and M. Tasche, Fast Fourier transforms for nonequispaced data: A tutorial, in Modern Sampling Theory: Mathematics and Applications, J.J. Benedetto and P.J.S.G. Ferreira, eds., Birkhäuser, Boston, MA, 2001, pp. 247-270.
53. D.F. Richards, M.P. Surh, J.A. Gunnels, J.N. Glosli, B. Chan, M.R. Dorr, E.W. Draeger, J.L. Fattebert, W.D. Krauss, T. Spelce, and F.H. Streitz, Beyond homogeneous decomposition: Scaling long-range forces on massively parallel systems, in Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, ACM Press, New York, 2009, 60.
54. ScaFaCoS - Scalable Fast Coloumb Solvers, http://scafacos.github.io.
55. G. Steidl, A note on fast Fourier transforms for nonequispaced grids, Adv. Comput. Math., 9 (1998), pp. 337-353.
56. D. Takahashi, An implementation of parallel 3-D FFT with 2-D decomposition on a massively parallel cluster of multi-core processors, in Parallel Processing and Applied Mathematics, Lecture Notes in Comput. Sci. 6067, R. Wyrzykowski, J. Dongarra, K. Karczewski, and J. Wasniewski, eds., Springer, Berlin, 2010, pp. 606-614.
57. T. Theuns, Parallel P3M with exact calculation of short range forces, Comput. Phys. Comm., 78 (1994), pp. 238-246.
58. T. Volkmer, OpenMP Parallelization in the NFFT Software Library, Preprint TU Chemnitz, preprint 7, 2012, http://www.tu-chemnitz.de/~potts/paper/ openmpNFFT.pdf.
59. A.F. Ware, Fast approximate Fourier transforms for irregularly spaced data, SIAM Rev., 40 (1998), pp. 838-856. (Pubitemid 128620599)