GEMMbench: a framework for reproducible and collaborative benchmarking of matrix multiplication
Anton Lokhmotov

TL;DR
GEMMbench is a new framework built on Collective Knowledge that enables reproducible, collaborative benchmarking of matrix multiplication performance across diverse platforms and implementations.
Contribution
It introduces a standardized methodology and a collaborative platform for evaluating GEMM performance, addressing the lack of common benchmarking practices.
Findings
Supports multiple data types and kernel implementations
Enables performance comparison across platforms
Facilitates crowdsourcing of GEMM implementations
Abstract
The generic matrix-matrix multiplication (GEMM) is arguably the most popular computational kernel of the 20th century. Yet, surprisingly, no common methodology for evaluating GEMM performance has been established over the many decades of using GEMM for comparing architectures, compilers and ninja-class programmers. We introduce GEMMbench, a framework and methodology for evaluating performance of GEMM implementations. GEMMbench is implemented on top of Collective Knowledge (CK), a lightweight framework for reproducible and collaborative R&D in computer systems. Using CK allows the R&D community to crowdsource hand-written and compiler-generated GEMM implementations and to study their performance across multiple platforms, data sizes and data types. Our initial implementation supports hand-written OpenCL kernels operating on matrices consisting of single- and double-precision…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Distributed and Parallel Computing Systems · Advanced Data Storage Technologies
