Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication
arXiv:2106.07731 · doi:10.1109/JSAC.2022.3142355
Abstract
We consider the problem of secure distributed matrix multiplication (SDMM). Coded computation has been shown to be an effective solution in distributed matrix multiplication, both providing privacy against workers and boosting the computation speed by efficiently mitigating stragglers. In this work, we present a non-direct secure extension of the recently introduced bivariate polynomial codes. Bivariate polynomial codes have been shown to be able to further speed up distributed matrix multiplication by exploiting the partial work done by the stragglers rather than completely ignoring them while reducing the upload communication cost and/or the workers' storage's capacity needs. We show that, especially for upload communication or storage constrained settings, the proposed approach reduces the average computation time of SDMM compared to its competitors in the literature.
arXiv commentTo appear in IEEE Journal on Selected Areas in Communications. arXiv admin note: text overlap with arXiv:2102.08304
References in corpus (11)
- Speeding Up Distributed Machine Learning Using Codes
- Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
- Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding
- Computation Scheduling for Distributed Machine Learning with Straggling Workers
- Straggler-aware Distributed Learning: Communication Computation Latency Trade-off
- Rate-Efficiency and Straggler-Robustness through Partition in Distributed Two-Sided Secure Matrix Computation
- Cross Subspace Alignment Codes for Coded Distributed Batch Computation
- Bivariate Polynomial Coding for Efficient Distributed Matrix Multiplication
- Uplink-Downlink Tradeoff in Secure Distributed Matrix Multiplication
- Rateless Codes for Private Distributed Matrix-Matrix Multiplication
- Secure Distributed Matrix Computation with Discrete Fourier Transform