Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2012, Pages 77-79

  Ballard, Grey ^a   Demmel, James ^a   Holtz, Olga ^a,b   Lipshitz, Benjamin ^a   Schwartz, Oded ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Communication avoiding algorithms; Fast matrix multiplication; Strong scaling

Indexed keywords

COMMUNICATION COST; DISTRIBUTED MEMORY; FAST MATRIX MULTIPLICATION; INTER PROCESSOR COMMUNICATION; LOWER BOUNDS; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM; PARALLEL MATRIX MULTIPLICATION ALGORITHMS; RUNNING TIME; STRONG SCALING;

COMMUNICATION; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

PARALLEL PROCESSING SYSTEMS;

EID: 84864146488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2312005.2312021     Document Type: Conference Paper

References (8)

1. Aggarwal, A., Chandra, A. K., and Snir, M. Communication complexity of PRAMs. Theoretical Computer Science 71, 1 (1990), 3-28. (Pubitemid 20676468)
2. Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., and Schwartz, O. Communication-optimal parallel algorithm for Strassen's matrix multiplication. In SPAA '12: Proceedings of the 24th Annual Symposium on Parallelism in Algorithms and Architectures (New York, NY, USA, 2012), ACM.
3. Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., and Schwartz, O. Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. EECS Technical Report EECS-2012-31, UC Berkeley, Mar. 2012.
4. Ballard, G., Demmel, J., Holtz, O., and Schwartz, O. Graph expansion and communication costs of fast matrix multiplication. In SPAA '11: Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures (New York, NY, USA, 2011), ACM, pp. 1-12.
5. Ballard, G., Demmel, J., Holtz, O., and Schwartz, O. Minimizing communication in numerical linear algebra. SIAM J. Matrix Analysis Applications 32, 3 (2011), 866-901.
6. Irony, D., Toledo, S., and Tiskin, A. Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Comput. 64, 9 (2004), 1017-1026. (Pubitemid 40000755)
7. Loomis, L. H., and Whitney, H. An inequality related to the isoperimetric inequality. Bulletin of the AMS 55 (1949), 961-962.
8. Solomonik, E., and Demmel, J. Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms. In Euro-Par '11: Proceedings of the 17th International European Conference on Parallel and Distributed Computing (2011), Springer.