Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 158

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A three-dimensional approach to parallel matrix multiplication

Agarwal, R. C., Balle, S. M., Gustavson, F. G., Joshi, M., Palkar, P. · 1995 · IBM Journal of Research and Development

Abstract

A three-dimensional (3D) matrix multiplication algorithm for massively parallel processing systems is presented. The P processors are configured as a “virtual” processing cube with dimensions p1, p2, and p3proportional to the matrices' dimensions—M, N, and K. Each processor performs a single local matrix multiplication of size M/p1× N/p2× K/p3. Before the local computation can be carried out, each subcube must receive a single submatrix of A and B. After the single matrix multiplication has completed, K/p3submatrices of this product must be sent to their respective destination processors and then summed together with the resulting matrix C. The 3D parallel matrix multiplication approach has a factor of P1/6less communication than the 2D parallel algorithms. This algorithm has been implemented on IBM POWERparallel™ SP2™ systems (up to 216 nodes) and has yielded close to the peak performance of the machine. The algorithm has been combined with Winograd's variant of Strassen's algorithm to achieve performance which exceeds the theoretical peak of the system. (We assume the MFLOPS rate of matrix multiplication to be 2MNK.)

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1147/rd.395.0575

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 158

Metadata

Authors
Agarwal, R. C., Balle, S. M., Gustavson, F. G., Joshi, M., & Palkar, P.
Venue
IBM Journal of Research and Development
Publisher
IBM
Published
1995-09
Volume
39
Issue
5
Pages
575-582
ISSN
0018-8646 (ISSN-L)
OpenAlex
W2012652661
Cited by
158
References
1
FWCI
0.00
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A three-dimensional approach to parallel matrix multiplication. https://app.cochat.ai/papers/10.1147/rd.395.0575
The paper
Agarwal, R. C., Balle, S. M., Gustavson, F. G., Joshi, M., & Palkar, P. (1995). A three-dimensional approach to parallel matrix multiplication. IBM Journal of Research and Development. https://doi.org/10.1147/rd.395.0575

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.