Securely Straggler-Exploiting Coded Computation for Distributed Matrix Multiplication
Open Access
- 14 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 167374-167388
Abstract
In this paper, we consider coded computation for matrix multiplication tasks in distributed computing, which can mitigate the effect of slow workers, called stragglers, using a coding approach. We assume that the straggler computation results can be leveraged at the master by assigning multiple sub-tasks to the workers. In this scenario, a new coded computation scheme is proposed to preserve the data security and privacy from workers, which is called securely straggler-exploiting codes (SSEC). Moreover, the proposed SSEC can efficiently reduce the communication load in distributed computing for assigning the sub-tasks to the workers, by overlapping the encoded matrices in assigning multiple sub-tasks with appropriate polynomial functions. It is also proven that the data security and privacy constraints are satisfied in SSEC in an information-theoretic sense. In conclusion, SSEC shows good performance on the recovery threshold and communication loads and compare them with the existing secure coded computation schemes for matrix multiplication tasks.Keywords
Funding Information
- National Research Foundation
This publication has 25 references indexed in Scilit:
- Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal CodingIEEE Transactions on Information Theory, 2020
- Private Coded Matrix MultiplicationIEEE Transactions on Information Forensics and Security, 2019
- Private Secure Coded ComputationIEEE Communications Letters, 2019
- On the Optimal Recovery Threshold of Coded Matrix MultiplicationIEEE Transactions on Information Theory, 2019
- Coded Computation Over Heterogeneous ClustersIEEE Transactions on Information Theory, 2019
- Secure Distributed Computing With Straggling Servers Using Polynomial CodesIEEE Transactions on Information Forensics and Security, 2018
- Speeding Up Distributed Machine Learning Using CodesIEEE Transactions on Information Theory, 2017
- The tail at scaleCommunications of the ACM, 2013
- Fast Polynomial Factorization and Modular CompositionSIAM Journal on Computing, 2011
- Factoring Polynomials Over Finite Fields: A SurveyJournal of Symbolic Computation, 2001