Pith. sign in

REVIEW 1 cited by

Matrix Engines for High Performance Computing:A Paragon of Performance or Grasping at Straws?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.14373 v2 pith:N6L4ODRU submitted 2020-10-27 cs.DC

classification cs.DC
keywords enginesmatrixperformanceapplicationsenthusiasmhighlearningprocessors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations

    cs.DC 2025-06 conditional novelty 4.0 of 10

    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.

Pith tools