General Matrix-Matrix Multiplication Using SIMD features of the PIII
Douglas Aberdeen, Jonathan Baxter

TL;DR
This paper presents an optimized implementation of general matrix-matrix multiplication leveraging SIMD features of the Intel Pentium PIII, achieving significant performance improvements over existing routines.
Contribution
The paper introduces a SIMD-based approach for matrix multiplication on the PIII, addressing memory hierarchy challenges to enhance computational efficiency.
Findings
Average performance is 2.09 times faster than existing routines.
Efficient utilization of all memory hierarchy levels.
Addresses SIMD implementation challenges for large matrices.
Abstract
Generalised matrix-matrix multiplication forms the kernel of many mathematical algorithms. A faster matrix-matrix multiply immediately benefits these algorithms. In this paper we implement efficient matrix multiplication for large matrices using the floating point Intel Pentium SIMD (Single Instruction Multiple Data) architecture. A description of the issues and our solution is presented, paying attention to all levels of the memory hierarchy. Our results demonstrate an average performance of 2.09 times faster than the leading public domain matrix-matrix multiply routines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
