DigiNews

Tech Watch by Johan Denoyer

← Back to articles

Matrix multiplication

Quality: 8/10 Relevance: 9/10

Summary

This article analyzes loop orderings for matrix multiplication and demonstrates cache-aware optimizations. It covers naïve implementations, loop order improvements (ikj, kij), blocking strategies, and SIMD intrinsics, as well as in-place transposition variants AB^T and A^T B.

🚀 Service construit par Johan Denoyer