Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer
DOI10.1016/J.CPC.2006.12.006zbMATH Open1196.65209OpenAlexW2000584869MaRDI QIDQ710047FDOQ710047
Authors: Bin Fang, Yuefan Deng, Glenn J. Martyna 
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2006.12.006
Recommendations
FFTmolecular dynamics simulationlong-range interactionparallel efficiencyab initio calculationblue matterstrong scalability
Computer aspects of numerical algorithms (65Y99) Parallel algorithms in computer science (68W10) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel fast Fourier transforms for electronic structure calculations
- Comments on P\(^3\)M, FMM, and the Ewald method for large periodic Coulombic systems
- The Future Fast Fourier Transform?
- Title not available (Why is that?)
- A fine grained parallel smooth particle mesh Ewald algorithm for biophysical simulation studies: application to the 6-D torus QCDOC supercomputer
Cited In (3)
- A fine grained parallel smooth particle mesh Ewald algorithm for biophysical simulation studies: application to the 6-D torus QCDOC supercomputer
- Parallel implementation of 3D FFT with volumetric decomposition schemes for efficient molecular dynamics simulations
- Multi-axis decomposition of density functional program for strong scaling up to 82,944 nodes on the K computer: compactly folded 3D-FFT communicators in the 6D torus network
Uses Software
This page was built for publication: Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710047)
