Abstract
A parallel implementation of Strassen’s matrix multiplication algorithm is proposed for massively parallel supercomputers with 2D all-port torus interconnection networks. The proposed algorithm employs conflict-free routing patterns and operates on completely-connected subnetworks in order to reduce the latency cost L of the algorithm down to L(n, P) = 6 log7 P on all-port 2D torus architectures having P nodes, which compares favorably to the latency cost L(n, P) = 36 log7 P of the recently proposed CAPS algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds. In: Proc. of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 77–79. ACM (2012)
Ballard, G., Demmel, J., Holtz, O., Lipshitz, B., Schwartz, O.: Communication-optimal parallel algorithm for Strassen’s matrix multiplication. In: Proc. of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 193–204. ACM (2012)
Baransel, C., İmre, K.: A parallel implementation of Strassen’s matrix multiplication algorithm for wormhole-routed all-port 2D torus networks. The Journal of Supercomputing 62(1), 486–509 (2012)
Demmel, J., Grigori, L., Hoemmen, M.F., Langou, J.: Communication-optimal Parallel and Sequential QR and LU Factorizations. SIAM J. Sci. Comput. 34(1), A206–A239 (2012)
Gramma, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison Wesley (2003)
Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. J. Parallel Distrib. Computing 64(9), 1017–1026 (2004)
Kolen, J.F., Bruce, P.: Evolutionary Search for Matrix Multiplication Algorithms. In: FLAIRS Conference, pp. 161–165 (2001)
Lipshitz, B., Ballard, G., Demmel, J., Schwartz, O.: Communication-avoiding parallel Strassen: Implementation and performance. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC 2012, Article 101, 11 p. (2012)
Luo, Q., Drake, J.B.: A Scalable Parallel Strassen’s Matrix Multiplication Algorithm for Distributed–Memory Computers. In: Proc. of the 1995 ACM Symposium on Applied Computing, pp. 221–226. ACM Press (1995)
Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer (2002)
Solomonik, E., Demmel, J.: Communication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol. 6853, pp. 90–109. Springer, Heidelberg (2011)
Strassen, V.: Gaussian Elimination is not Optimal. Numerische Mathematik 13, 354–356 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baransel, C. (2013). Strassen’s Communication-Avoiding Parallel Matrix Multiplication Algorithm for All-Port 2D Torus Networks. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2013. Lecture Notes in Computer Science, vol 7979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39958-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-39958-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39957-2
Online ISBN: 978-3-642-39958-9
eBook Packages: Computer ScienceComputer Science (R0)