# Matrix multiplication and universal scalability of the time on the Intel Scalable processors

## TL;DR

This paper investigates the scalability of large-scale matrix multiplication on Intel Xeon processors, demonstrating a universal and perfect scalability law applicable to high-performance scientific computing tasks.

## Contribution

It provides empirical evidence of a universal scalability law for matrix multiplication on Intel Scalable processors with large memory and multi-core architecture.

## Key findings

- Observed perfect scalability law in matrix multiplication
- Demonstrated universality of the scalability law across hardware configurations
- Validated scalability results with experiments on 1.5 terabyte memory system

## Abstract

Matrix multiplication is one of the core operations in many areas of scientific computing. We present the results of the experiments with the matrix multiplication of the big size comparable with the big size of the onboard memory, which is 1.5 terabyte in our case. We run experiments on the computing board with two sockets and with two Intel Xeon Platinum 8164 processors, each with 26 cores and with multi-threading. The most interesting result of our study is the observation of the perfect scalability law of the matrix multiplication, and of the universality of this law.