Cyclops tensor framework: Reducing communication and eliminating load imbalance in massively parallel contractions

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium, IPDPS 2013

Volumn , Issue , 2013, Pages 813-824

  Solomonik, Edgar ^a   Matthews, Devin ^b   Hammond, Jeff ^c   Demmel, James ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

communication avoiding algorithms; Coupled Cluster; Cyclops; tensor contractions

Indexed keywords

COUPLED CLUSTERS; CYCLOPS; DOMAIN SPECIFIC LANGUAGES; MASSIVELY PARALLELS; MATRIX MULTIPLICATION; TENSOR CONTRACTION; USER-LEVEL INTERFACE; VIRTUALIZATION LAYERS;

COMMUNICATION; DISTRIBUTED PARAMETER NETWORKS; ELECTRONIC STRUCTURE; MAPPING; NUMERICAL METHODS; SUPERCOMPUTERS;

TENSORS;

EID: 84884845041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2013.112     Document Type: Conference Paper

References (36)

1. J. Čížek, "On the correlation problem in atomic and molecular systems. calculation of wavefunction components in Ursell-Type expansion using Quantum-Field theoretical methods," The Journal of Chemical Physics, vol. 45, no. 11, pp. 4256-4266, Dec. 1966.
2. R. J. Bartlett and M. Musiał, "Coupled-cluster theory in quantum chemistry," Reviews of Modern Physics, vol. 79, no. 1, pp. 291-352, 2007.
3. E. J. Bylaska et. al., "NWChem, a computational chemistry package for parallel computers, version 6.1.1," 2012.
4. T. D. Crawford and H. F. Schaefer III, "An introduction to coupled cluster theory for computational chemists," Reviews in Computational Chemistry, vol. 14, p. 33, 2000.
5. G. D. Purvis and R. J. Bartlett, "A full coupledcluster singles and doubles model: The inclusion of disconnected triples," The Journal of Chemical Physics, vol. 76, no. 4, pp. 1910-1918, Feb. 1982.
6. Y. S. Lee, S. A. Kucharski, and R. J. Bartlett, "A coupled cluster approach with triple excitations," Journal of Chemical Physics, vol. 81, no. 12, p. 5906, 1984.
7. J. Noga and R. J. Bartlett, "The full CCSDT model for molecular electronic structure," Journal of Chemical Physics, vol. 86, no. 12, p. 7041, 1987.
8. S. A. Kucharski and R. J. Bartlett, "Recursive intermediate factorization and complete computational linearization of the coupled-cluster single, double, triple, and quadruple excitation equations," Theoretica Chimica Acta, vol. 80, no. 4-5, pp. 387-405, 1991.
9. E. Solomonik and J. Demmel, "Communication-optimal 2.5D matrix multiplication and LU factorization algorithms," in Lecture Notes in Computer Science, Euro-Par, Bordeaux, France, Aug 2011.
10. G. Baumgartner, A. Auer, D. Bernholdt, A. Bibireata, V. Choppella, D. Cociorva, X. Gao, R. Harrison, S. Hirata, S. Krishnamoorthy, S. Krishnan, C. Lam, Q. Lu, M. Nooijen, R. Pitzer, J. Ramanujam, P. Sadayappan, and A. Sibiryakov, "Synthesis of high-performance parallel programs for a class of ab initio quantum chemistry models," Proceedings of the IEEE, vol. 93, no. 2, pp. 276-292, feb. 2005.
11. E. A. Auer, G. Baumgartner, D. E. Bernholdt, A. Bibireata, D. Cociorva, X. Gao, R. Harrison, S. Krishnamoorthy, H. Krishnan, C. chung Lam, Q. Lu, M. Nooijen, R. Pitzer, J. Ramanujam, and E. Sibiryakov, "Automatic code generation for many-body electronic structure methods: The tensor contraction engine," 2006.
12. X. Gao, S. Krishnamoorthy, S. Sahoo, C.-C. Lam, G. Baumgartner, J. Ramanujam, and P. Sadayappan, "Efficient search-space pruning for integrated fusion and tiling transformations," in Languages and Compilers for Parallel Computing, ser. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2006, vol. 4339, pp. 215-229.
13. J. Nieplocha, R. J. Harrison, and R. J. Littlefield, "Global arrays: A nonuniform memory access programming model for high-performance computers," The Journal of Supercomputing, vol. 10, pp. 169-189, 1996, 10.1007/BF00130708. (Pubitemid 126723336)
14. V. Lotrich, N. Flocke, M. Ponton, B. A. Sanders, E. Deumens, R. J. Bartlett, and A. Perera, "An infrastructure for scalable and portable parallel programs for computational chemistry," in Proceedings of the 23rd international conference on Supercomputing, ser. ICS '09. New York, NY, USA: ACM, 2009, pp. 523-524.
15. E. Deumens, V. F. Lotrich, A. Perera, M. J. Ponton, B. A. Sanders, and R. J. Bartlett, "Software design of aces iii with the super instruction architecture," Wiley Interdisciplinary Reviews: Computational Molecular Science, vol. 1, no. 6, pp. 895-901, 2011.
16. M. Kállay and P. R. Surján, "Higher excitations in coupled-cluster theory," The Journal of Chemical Physics, vol. 115, no. 7, p. 2945, 2001.
17. 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, ser. STOC '81. New York, NY, USA: ACM, 1981, pp. 326-333.
18. G. Ballard, J. Demmel, O. Holtz, and O. Schwartz, "Minimizing communication in linear algebra," SIAM J. Mat. Anal. Appl., vol. 32, no. 3, 2011.
19. D. Irony, S. Toledo, and A. Tiskin, "Communication lower bounds for distributed-memory matrix multiplication," Journal of Parallel and Distributed Computing, vol. 64, no. 9, pp. 1017-1026, 2004. (Pubitemid 40000755)
20. L. E. Cannon, "A cellular computer to implement the Kalman filter algorithm," Ph.D. dissertation, Bozeman, MT, USA, 1969.
21. R. C. Agarwal, S. M. Balle, F. G. Gustavson, M. Joshi, and P. Palkar, "A three-dimensional approach to parallel matrix multiplication," IBM J. Res. Dev., vol. 39, pp. 575-582, September 1995.
22. R. A. Van De Geijn and J. Watts, "SUMMA: scalable universal matrix multiplication algorithm," Concurrency: Practice and Experience, vol. 9, no. 4, pp. 255-274, 1997. (Pubitemid 127679707)
23. A. Aggarwal, A. K. Chandra, and M. Snir, "Communication complexity of PRAMs," Theoretical Computer Science, vol. 71, no. 1, pp. 3-28, 1990.
24. G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz, "Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds," in Proceedinbgs of the 24th ACM symposium on Parallelism in algorithms and architectures, ser. SPAA '12. New York, NY, USA: ACM, 2012, pp. 77-79. [Online]. Available: http://doi.acm.org/10.1145/2312005.2312021
25. E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms," SIAM Journal on Computing, vol. 10, no. 4, pp. 657-675, 1981.
26. S. L. Johnsson, "Minimizing the communication time for matrix multiplication on multiprocessors," Parallel Comput., vol. 19, pp. 1235-1257, November 1993.
27. E. Solomonik, A. Bhatele, and J. Demmel, "Improving communication performance in dense linear algebra via topology aware collectives," in Supercomputing, Seattle, WA, USA, Nov 2011.
28. G. E. Scuseria and H. F. Schaefer III, "Is coupled cluster singles and doubles (CCSD) more computationally intensive than quadratic configuration interaction (QCISD)?" vol. 90, no. 7, pp. 3700-3703, 1989.
29. L. S. Blackford, J. Choi, A. Cleary, E. D'Azeuedo, J. Demmel, I. Dhillon, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley, ScaLAPACK user's guide, J. J. Dongarra, Ed. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1997.
30. J. Poulson, B. Maker, J. R. Hammond, N. A. Romero, and R. van de Geijn, "Elemental: A new framework for distributed memory dense matrix computations," ACM Transactions on Mathematical Software, in press.
31. L. V. Kale and S. Krishnan, "CHARM++: a portable concurrent object oriented system based on C++," in Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications, ser. OOPSLA '93. New York, NY, USA: ACM, 1993, pp. 91-108.
32. W. Gropp, E. Lusk, and A. Skjellum, Using MPI: portable parallel programming with the message-passing interface. Cambridge, MA, USA: MIT Press, 1994.
33. S. S. Shende and A. D. Malony, "The TAU parallel performance system," International Journal of High Performance Computing Applications, vol. 20, no. 2, pp. 287-311, Summer 2006.
34. R. Haring, M. Ohmacht, T. Fox, M. Gschwind, D. Satterfield, K. Sugavanam, P. Coteus, P. Heidelberger, M. Blumrich, R. Wisniewski, A. Gara, G.-T. Chiu, P. Boyle, N. Chist, and C. Kim, "The IBM Blue Gene/Q compute chip," Micro, IEEE, vol. 32, no. 2, pp. 48-60, march-april 2012.
35. D. Chen, N. A. Eisley, P. Heidelberger, R. M. Senger, Y. Sugawara, S. Kumar, V. Salapura, D. L. Satterfield, B. Steinmacher-Burow, and J. J. Parker, "The IBM Blue Gene/Q interconnection network and message unit," in Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, ser. SC '11. New York, NY, USA: ACM, 2011, pp. 26:1-26:10.
36. L. S. Blackford, J. Choi, A. Cleary, E. D'Azeuedo, J. Demmel, I. Dhillon, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley, ScaLAPACK user's guide, J. J. Dongarra, Ed. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1997.