Bivariate and trivariate polynomial coding schemes that support arbitrary matrix partitions reduce upload communication overheads relative to univariate codes for distributed matrix-matrix multiplication.
Polynomial codes: An optimal design for high-dimensional coded matrix multiplication,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication
Bivariate and trivariate polynomial coding schemes that support arbitrary matrix partitions reduce upload communication overheads relative to univariate codes for distributed matrix-matrix multiplication.