The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
On the Optimal Recovery Threshold of Coded Matrix Multiplication
Open accessAbstract
We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent “Polynomial code” constructions in recovery threshold, i.e., the required number of successful workers. When a fixed 1/m fraction of each matrix can be stored at each worker node, Polynomial codes require m2 successful workers, while our MatDot codes only require 2m - 1 successful workers. However, MatDot codes have higher computation cost per worker and higher communication cost from each worker to the fusion node. We also provide a systematic construction of MatDot codes. Furthermore, we propose “PolyDot” coding that interpolates between Polynomial codes and MatDot codes to trade off computation/communication costs and recovery thresholds. Finally, we demonstrate a novel coding technique for multiplying n matrices (n ≥ 3) using ideas from MatDot and PolyDot codes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Dean, J., & Barroso, L. A. (2013) · Communications of the ACM · doi:10.1145/2408776.2408794 · Cited by 1,852
Algorithm-Based Fault Tolerance for Matrix Operations
Huang, K.-H., & Abraham, J. A. (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676475 · Cited by 1,283
Speeding Up Distributed Machine Learning Using Codes
Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2736066 · Cited by 829
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Solution of Vandermonde systems of equations
Björck, Ȧ., & Pereyra, V. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0290541-1 · Cited by 398
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10464 · Cited by 350
“Short-Dot”: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products
Dutta, S., Cadambe, V., & Grover, P. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2927558 · Cited by 313
Self-citationCoded computation over heterogeneous clusters
Reisizadeh, A., Prakash, S., Pedarsani, R., & Avestimehr, S. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006961 · Cited by 268
High-dimensional coded matrix multiplication
Lee, K., Suh, C., & Ramchandran, K. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006963 · Cited by 230
Fraenkel, A. S. (1985) · American Mathematical Monthly · doi:10.1080/00029890.1985.11971550 · Cited by 223
Fast Polynomial Factorization and Modular Composition
Kedlaya, K. S., & Umans, C. (2011) · SIAM Journal on Computing · doi:10.1137/08073408x · Cited by 218
On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems
Joshi, G., Liu, Y., & Soljanin, E. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.140518 · Cited by 186
A Unified Coding Framework for Distributed Computing with Straggling Servers
Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2016) · 2016 IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2016.7848828 · Cited by 175
Improving Distributed Gradient Descent Using Reed-Solomon Codes
Halbawi, W., Azizan, N., Salehi, F., & Hassibi, B. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437467 · Cited by 169
Coded convolution for parallel and distributed computing within a deadline
Dutta, S., Cadambe, V. R., & Grover, P. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006960 · Cited by 134
Self-citationLi, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447112 · Cited by 127
Using Straggler Replication to Reduce Latency in Large-scale Parallel Computing
Wang, D., Joshi, G., & Wornell, G. W. (2015) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2847220.2847223 · Cited by 126
Fault Tolerance Techniques for High-Performance Computing
Dongarra, J. J., Thomas Herault, A., & Robert, Y. L. (2015) · Computer communications and networks · doi:10.1007/978-3-319-20943-2_1 · Cited by 122
Straggler Mitigation in Distributed Optimization Through Data EncodingPreprint
Karakus, C., Sun, Y., Diggavi, S. N., & Yin, W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.04969 · Cited by 118
Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication
Mallick, A., Chaudhari, M., Sheth, U., Palanikumar, G., & Joshi, G. (2019) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3366706 · Cited by 115
Coded Sparse Matrix MultiplicationPreprint
Wang, S., Liu, J., & Shroff, N. B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.03430 · Cited by 114
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437563 · Cited by 108
A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes
Dutta, S., Bai, Z., Jeong, H., Low, T. M., & Grover, P. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437852 · Cited by 103
Self-citationBlock-Diagonal and LT Codes for Distributed Computing With Straggling Servers
Severinson, A., Amat, A. G. I., & Rosnes, E. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2877391 · Cited by 97
Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2015) · Cited by 93
On the optimal recovery threshold of coded matrix multiplication
Fahim, M., Jeong, H., Haddadpour, F., Dutta, S., Cadambe, V. R., & Grover, P. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262882 · Cited by 81
Self-citationAssociated Polynomials and Uniform Methods for the Solution of Linear Problems
Traub, J. F. (1966) · SIAM Review · doi:10.1137/1008061 · Cited by 74
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262778 · Cited by 65
Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes
Baharav, T. Z., Lee, K., Öçal, O., & Ramchandran, K. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437549 · Cited by 62
Encoded distributed optimization
Karakus, C., Sun, Y., & Diggavi, S. N. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007058 · Cited by 55
The Fast Generalized Parker–Traub Algorithm for Inversion of Vandermonde and Related Matrices
Gohberg, I., & Olshevsky, V. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0442 · Cited by 54
Coded distributed computing for inverse problems
Yang, Y. L., Grover, P., & Kar, S. (2017) · neural information processing systems · Cited by 48
Self-citationCoded computation for multicore setups
Lee, K., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K. (2017) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8006962 · Cited by 45
Coded Distributed Computing: Straggling Servers and Multistage Dataflows
Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852225 · Cited by 43
Latency analysis of coded computation schemes over wireless networks
Reisizadeh, A., & Pedarsani, R. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262881 · Cited by 43
Effective Straggler Mitigation: Which Clones Should Attack and When?
Aktas, M. F., Peng, P., & Soljanin, E. (2017) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3152042.3152047 · Cited by 43
Gradient CodingPreprint
Tandon, R., Lei, Q., Dimakis, A. G., & Karampatziakis, N. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.03301 · Cited by 41
Efficient task replication for fast response times in parallel computation
Wang, D., Joshi, G., & Wornell, G. W. (2014) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/2637364.2592042 · Cited by 40
Straggler Mitigation by Delayed Relaunch of Tasks
Aktaş, M. F., Peng, P., & Soljanin, E. (2018) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3199524.3199564 · Cited by 39
Li, S., Supittayapornpong, S., Maddah-Ali, M. A., & Avestimehr, S. (2017) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2017.33 · Cited by 38
Inverses of Vandermonde matrices
Parker, F. D. (1964) · The American Mathematical Monthly · doi:10.2307/2313246 · Cited by 35
Fast and Efficient Distributed Matrix-vector Multiplication Using Rateless Fountain Codes
Mallick, A., Chaudhari, M., & Joshi, G. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682347 · Cited by 35
Matrix sparsification for coded matrix multiplication
Suh, G., Lee, K., & Suh, C. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262883 · Cited by 33
Distributed Solution of Large-Scale Linear Systems Via Accelerated Projection-Based Consensus
Azizan, N., Lahouti, F., Avestimehr, S., & Hassibi, B. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2917855 · Cited by 31
Sheth, U., Dutta, S., Chaudhari, M., Jeong, H., Yang, Y. L., Kohonen, J., Roos, T., & Grover, P. (2018) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2018.8622429 · Cited by 31
Self-citationMasterless Coded Computing: A Fully-Distributed Coded FFT Algorithm
Jeong, H., Low, T. M., & Grover, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636047 · Cited by 18
Self-citationFault-tolerant distributed logistic regression using unreliable components
Yang, Y. L., Grover, P., & Kar, S. (2016) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2016.7852335 · Cited by 17
Self-citationCross-Iteration Coded Computing
Haddadpour, F., Yang, Y. L., Cadambe, V. R., & Grover, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8635933 · Cited by 17
Self-citation
Cited by
Xu, M., Ng, W. C., Lim, W. Y. B., Kang, J., Xiong, Z., Niyato, D., Yang, Q., Shen, X., & Miao, C. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3221119 · Cited by 564
“Short-Dot”: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products
Dutta, S., Cadambe, V., & Grover, P. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2927558 · Cited by 313
Self-citationSecure and Efficient Coded Multi-Access Edge Computing With Generalized Graph Neural Networks
Asheralieva, A., & Niyato, D. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3172117 · Cited by 15
Metadata
- Authors
- Dutta, S., Fahim, M., Haddadpour, F., Jeong, H., Cadambe, V., & Grover, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2020-01
- Volume
- 66
- Issue
- 1
- Pages
- 278-301
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2782956234
- Cited by
- 282
- References
- 50
- FWCI
- 22.86
- Type
- journal article
- Language
- en
- Open access
- green
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
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.