The paper proposes a triple-stage outer-product algorithm and an isomorphic 3D mesh architecture that computes separable 3D orthogonal transforms in N1+N2+N3 time steps.
Matrix Engines for High Performance Computing:A Paragon of Performance or Grasping at Straws?
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Matrix engines or units, in different forms and affinities, are becoming a reality in modern processors; CPUs and otherwise. The current and dominant algorithmic approach to Deep Learning merits the commercial investments in these units, and deduced from the No.1 benchmark in supercomputing, namely High Performance Linpack, one would expect an awakened enthusiasm by the HPC community, too. Hence, our goal is to identify the practical added benefits for HPC and machine learning applications by having access to matrix engines. For this purpose, we perform an in-depth survey of software stacks, proxy applications and benchmarks, and historical batch job records. We provide a cost-benefit analysis of matrix engines, both asymptotically and in conjunction with state-of-the-art processors. While our empirical data will temper the enthusiasm, we also outline opportunities to misuse these dense matrix-multiplication engines if they come for free.
citation-role summary
citation-polarity summary
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations
The paper proposes a triple-stage outer-product algorithm and an isomorphic 3D mesh architecture that computes separable 3D orthogonal transforms in N1+N2+N3 time steps.