Communication analysis of parallel 3D FFT for flat cartesian meshes on large Blue Gene systems

  • Authors:
  • Anthony Chan;Pavan Balaji;William Gropp;Rajeev Thakur

  • Affiliations:
  • ASCI FLASH Center, University of Chicago;Math. and Comp. Sci. Division, Argonne National Laboratory;Dept. of Computer Science, University of Illinois, Urbana-Champaign;Math. and Comp. Sci. Division, Argonne National Laboratory

  • Venue:
  • HiPC'08 Proceedings of the 15th international conference on High performance computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallel 3D FFT is a commonly used numerical method inscientific computing. P3DFFT is a recently proposed implementationof parallel 3D FFT that is designed to allow scalability to massivelylarge systems such as Blue Gene. While there has been recent workthat demonstrates such scalability on regular cartesian meshes (equallength in each dimension), its performance and scalability for flat cartesianmeshes (much smaller length in one dimension) is still a concern. Inthis paper, we perform studies on a 16-rack (16384-node) Blue Gene/Lsystem that demonstrates that a combination of the network topologyand the communication pattern of P3DFFT can result in early networksaturation and consequently performance loss. We also show that remappingprocesses on nodes and rotating the mesh by taking the communicationproperties of P3DFFT into consideration, can help alleviate thisproblem and improve performance by up to 48% in some special cases.