On the communication complexity of 3D FFTs and its implications for exascale

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2012, Pages 205-214

  Czechowski, Kenneth ^a   Battaglino, Casey ^a   McClanahan, Chris ^a   Iyer, Kartik ^b   Yeung, P K ^a,b   Vuduc, Richard ^a  

^a Georgia Institute of Technology   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Exascale; FFT; Performance model

Indexed keywords

ALL-TO-ALL COMMUNICATION; CO-PROCESSORS; COMMUNICATION COMPLEXITY; CURRENT TECHNOLOGY; EXASCALE; INTRA-NODE COMMUNICATION; MEMORY BANDWIDTHS; MEMORY HIERARCHY; NETWORK BANDWIDTH; NETWORK COMMUNICATIONS; PERFORMANCE IMPACT; PERFORMANCE MODEL; POTENTIAL SCALING; SOFTWARE IMPLEMENTATION;

FAST FOURIER TRANSFORMS; INTELLIGENT CONTROL; PROGRAM PROCESSORS; THREE DIMENSIONAL;

COMMUNICATION;

EID: 84864032930     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2304576.2304604     Document Type: Conference Paper

References (43)

1. The HPC Challenge benchmark. http://icl.cs.utk.edu/hpcc.
2. R. Agarwal, F. Gustavson, and M. Zubair. An efficient parallel algorithm for the 3-D FFT NAS parallel benchmark. In Proceedings of IEEE Scalable High Performance Computing Conference, pages 129-133. IEEE Comput. Soc. Press, 1994.
3. G. Almasi et al. Cellular supercomputing with system-on-a-chip. In 2002 IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No.02CH37315), pages 196-197. Ieee, 2002.
4. D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. FAWN: A fast array of wimpy nodes. Communications of the ACM, 54(7):101-109, July 2011.
5. C. Bell, D. Bonachea, R. Nishtala, and K. Yelick. Optimizing Bandwidth Limited Problems Using One-Sided Communication and Overlap. In Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, pages 1-10. IEEE, 2006.
6. G. E. Blelloch, B. M. Maggs, and G. L. Miller. The hidden cost of low bandwidth communication. In U. Vishkin, editor, Developing a Computer Science Agenda for High-Performance Computing, pages 22-25. ACM, New York, NY, USA, 1994.
7. R. Brightwell, K. T. Pedretti, K. D. Underwood, and T. Hudson. Seastar interconnect: Balanced bandwidth for scalable performance. IEEE Micro, 26:41-57, May 2006. (Pubitemid 44194067)
8. D. Callahan, J. Cocke, and K. Kennedy. Estimating interlock and improving balance for pipelined architectures. Journal of Parallel and Distributed Computing, 5(4):334-358, Aug. 1988.
9. A. Chan, P. Balaji, W. Gropp, and R. Thakur. Communication analysis of parallel 3d fft for flat cartesian meshes on large blue gene systems. In Proceedings of the 15th international conference on High performance computing, pages 350-364. Springer-Verlag, 2008.
10. C. E. Cramer and J. Board. The development and integration of a distributed 3D FFT for a cluster of workstations. In Proceedings of the 4th Annual Linux Showcase & Conference, Atlanta, GA, USA, 2000.
11. K. Czechowski, C. Battaglino, C. Mcclanahan, A. Chandramowlishwaran, and R. Vuduc. Balance principles for algorithm-architecture co-design. In USENIX Wkshp. Hot Topics in Parallelism (HotPar), pages 1-5, Berkeley, CA, USA, 2011. Usenix Association.
12. K. Datta, D. Bonachea, and K. Yelick. Titanium Performance and Potential: An NPB Experimental Study. In Proceedings of the Languages and Compilers for Parallel Computing (LCPC) Workshop, volume LNCS 4339, pages 200-214, 2006. (Pubitemid 351702211)
13. H. Q. Ding, R. D. Ferraro, and D. B. Gennery. A Portable 3D FFT Package for Distributed-Memory Parallel Architectures. In Proceedings of 7th SIAM Conference on Parallel Processing, pages 70 - 71. SIAM Press, 1995.
14. P. Dmitruk, L.-P. Wang, W. H. Mattaeus, R. Zhang, and D. Seckel. Scalable parallel FFT for spectral simulations on a Beowulf cluster. Parallel Computing, 27(14):1921-1936, Dec. 2001. (Pubitemid 32997727)
15. J. Doi and Y. Negishi. Overlapping Methods of All-to-All Communication and FFT Algorithms for Torus-Connected Massively Parallel Supercomputers. In 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, number November, pages 1-9. IEEE, Nov. 2010.
16. J. Dongarra et al. The international exascale software project roadmap. IJHPCA, 25(1):3-60, 2011.
17. 4) processors. 2008.
18. A. Edelman, P. McCorquodale, and S. Toledo. The Future Fast Fourier Transform? SIAM Journal on Scientific Computing, 20(3):1094, 1998.
19. M. Eleftheriou, B. Fitch, A. Rayshubskiy, T. Ward, and R. Germain. Scalable framework for 3D FFTs on the Blue Gene/L supercomputer: implementation and early performance measurements. IBM Journal of Research and Development, 49(2.3):457-464, 2005. (Pubitemid 40718146)
20. B. FANG, Y. DENG, and G. MARTYNA. Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer. Computer Physics Communications, 176(8):531-538, Apr. 2007. (Pubitemid 46435804)
21. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS '99, pages 285-, Washington, DC, USA, 1999. IEEE Computer Society.
22. H. Gahvari and W. Gropp. An introductory exascale feasibility study for FFTs and multigrid. In 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pages 1-9, Atlanta, GA, USA, Apr. 2010. IEEE.
23. M. Garland and D. B. Kirk. Understanding throughput-oriented architectures. Communications of the ACM, 53(11):58, Nov. 2010.
24. L. Giraud, R. Guivarch, and J. Stein. Parallel Distributed FFT-Based Solvers for 3-D Poisson Problems in Meso-Scale Atmospheric Simulations. International Journal of High Performance Computing Applications, 15(1):36-46, Feb. 2001. (Pubitemid 32252488)
25. L. Gu, X. Li, and J. Siegel. An empirically tuned 2D and 3D FFT library on CUDA GPU. In Proceedings of the 24th ACM International Conference on Supercomputing - ICS '10, page 305, Tsukuba, Japan, 2010. ACM Press.
26. Z. Guz, E. Bolotin, I. Keidar, A. Kolodny, A. Mendelson, and U. C. Weiser. Many-core vs. many-thread machines: Stay away from the valley. IEEE Computer Architecture Letters, 8:25-28, 2009.
27. J. Hein, H. Jagode, U. Sigrist, A. Simpson, and A. Trew. Parallel 3D-FFTs for multi-core nodes on a mesh communication network. In Proceedings of the Cray User's Group (CUG) Meeting, pages 1-15, Helsinki, Finland, 2008.
28. H. Jagode, J. Hein, and A. Trew. Task placement of parallel multidimensional ffts on a mesh communication network. University of Tennessee Knoxville, Technical Report No. ut-cs-08-613, 2008.
29. H. Jia-Wei and H. T. Kung. I/O complexity: The red-blue pebble game. In Proceedings of the thirteenth annual ACM symposium on Theory of computing-STOC '81, pages 326-333, New York, New York, USA, May 1981. ACM Press.
30. P. Kogge and T. Dysart. Using the top500 to trace and project technology and architecture trends. In Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, page 28. ACM, 2011.
31. P. Kogge et al. Exascale Computing Study: Technology challenges in acheiving exascale systems, Sept. 2008.
32. S. Kumar, Y. Sabharwal, R. Garg, and P. Heidelberger. Optimization of All-to-All Communication on the Blue Gene/L Supercomputer. In 2008 37th International Conference on Parallel Processing, pages 320-329. IEEE, Sept. 2008.
33. H. T. Kung. Memory requirements for balanced computer architectures. In Proceedings of the ACM Int'l. Symp. Computer Architecture (ISCA), Tokyo, Japan, 1986.
34. G. H. Loh. 3D-Stacked Memory Architectures for Multi-core Processors. In 2008 International Symposium on Computer Architecture, pages 453-464. IEEE, June 2008.
35. J. McCalpin. Memory Bandwidth and Machine Balance in High Performance Computers. IEEE Technical Committee on Computer Architecture (TCCA) Newsletter, Dec. 1995.
36. D. Pekurovsky and J. H. Goebbert. P3DFFT - highly scalable parallel 3d fast fourier transforms library. http://www.sdsc.edu/us/resources/p3dfft, November 2010.
37. S. J. Pennycook, S. D. Hammond, S. A. Jarvis, and G. R. Mudalige. Performance analysis of a hybrid MPI/CUDA implementation of the NAS-LU benchmark. In Proceedings of the International Workshop on Performance Modeling, Benchmarking and Simulation (PMBS), New Orleans, LA, USA, Nov. 2010.
38. V. J. Reddi, B. C. Lee, T. Chilimbi, and K. Vaid. Web search using mobile cores: Quantifying and mitigating the price of efficiency. ACM SIGARCH Computer Architecture News, 38(3):215-314, June 2010.
39. U. Sigrist. Optimizing parallel 3D fast Fourier transformations for a cluster of IBM POWER5 SMP nodes. PhD thesis, The University of Edinburgh, 2007.
40. D. Takahashi. A Parallel 3-D FFT Algorithm on Clusters of Vector SMPs. In Proceedings of Applied Parallel Computing: New Paradigms for HPC in Industry and Academia, volume LNCS 1947, pages 316-323, 2001. (Pubitemid 33239312)
41. J. Vetter, R. Glassbrook, J. Dongarra, K. Schwan, B. Loftis, S. McNally, J. Meredith, J. Rogers, P. Roth, K. Spafford, et al. Keeneland: Bringing heterogeneous gpu computing to the computational science community. IEEE Computing in Science and Engineering, 13(5):90-95, 2011.
42. H. Wang, S. Potluri, M. Luo, A. Singh, S. Sur, and D. Panda. MVAPICH2-GPU: optimized GPU to GPU communication for InfiniBand clusters. Computer Science-Research and Development, pages 1-10.
43. C. Young, J. Bank, R. Dror, J. Grossman, J. Salmon, and D. Shaw. A 32×32×32, spatially distributed 3D FFT in four microseconds on Anton. In Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, page 23. ACM, 2009.