An implementation of matrix–matrix multiplication on the Intel KNL processor with AVX-512
- Authors
- Lim, R.; Lee, Y.; Kim, R.; Choi, J.
- Issue Date
- Jun-2018
- Publisher
- Springer New York LLC
- Keywords
- Matrix-matrix multiplication; Knights Landing; AVX-512; Vectorization; Threading
- Citation
- Cluster Computing, v.21, no.4, pp.1785 - 1795
- Journal Title
- Cluster Computing
- Volume
- 21
- Number
- 4
- Start Page
- 1785
- End Page
- 1795
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/31309
- DOI
- 10.1007/s10586-018-2810-y
- ISSN
- 1386-7857
- Abstract
- The second generation Intel Xeon Phi processor codenamed Knights Landing (KNL) have recently emerged with 2D tile mesh architecture and the Intel AVX-512 instructions. However, it is very difficult for general users to get the maximum performance from the new architecture since they are not familiar with optimal cache reuse, efficient vectorization, and assembly language. In this paper, we illustrate several developing strategies to achieve good performance with C programming language by carrying out general matrix–matrix multiplications and without the use of assembly language. Our implementation of matrix–matrix multiplication is based on blocked matrix multiplication as an optimization technique that improves data reuse. We use data prefetching, loop unrolling, and the Intel AVX-512 to optimize the blocked matrix multiplications. When we use a single core of the KNL, our implementation achieves up to 98% of SGEMM and 99% of DGEMM using the Intel MKL, which is the current state-of-the-art library. Our implementation of the parallel DGEMM using all 68 cores of the KNL achieves up to 90% of DGEMM using the Intel MKL.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/31309)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.