Fetching the paper…
Reading the bibliography…
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.
M. G. Taylor, “Reliable information storage in memories designed from unreliable components,” Bell System Technical Journal , vol. 47, no. 10, pp. 2299–2337, 1968
1968
Earlier work this paper cites.
V. Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik , vol. 13, no. 4, pp. 354–356, 1969
1969
Earlier work this paper cites.
H. T. Kung, “Fast evaluation and interpolation,” Carnegie Mellon University, Tech. Rep., 1973
1973
Earlier work this paper cites.
K. H. Huang and J. Abraham, “Algorithm-Based Fault Tolerance for Matrix Operations,” IEEE Transactions on Computers , vol. 100, no. 6, pp. 518–528, 1984
1984
Earlier work this paper cites.
A. S. Fraenkel, “Systems of numeration,” The American Mathematical Monthly , vol. 92, no. 2, pp. 105–114, 1985
1985
Earlier work this paper cites.
L. Li, “On the arithmetic operational complexity for solving vandermonde linear equations,” Japan journal of industrial and applied mathematics , vol. 17, no. 1, pp. 15–18, 2000
2000
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM , vol. 56, no. 2, pp. 74–80, 2013
2013
Earlier work this paper cites.
G. Joshi, Y. Liu, and E. Soljanin, “On the delay-storage trade-off in content download from coded distributed storage systems,” IEEE Journal on Selected Areas in Communications , vol. 32, no. 5, pp. 989–997, 2014
2014
Earlier work this paper cites.
D. Wang, G. Joshi, and G. Wornell, “Efficient Task Replication for Fast Response Times in Parallel Computation,” ACM SIGMETRICS Performance Evaluation Review , vol. 42, no. 1, pp. 599–600, 2014
2014
Earlier work this paper cites.
Y. Yang, P. Grover, and S. Kar, “Can a noisy encoder be used to communicate reliably?” in Communication, Control, and Computing (Allerton) , 2014, pp. 659–666
2014
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded mapreduce,” in Communication, Control, and Computing (Allerton) , 2015, pp. 964–971
2015
Earlier work this paper cites.
D. Wang, G. Joshi, and G. Wornell, “Using Straggler Replication to Reduce Latency in Large-Scale Parallel Computing,” ACM SIGMETRICS Performance Evaluation Review , vol. 43, no. 3, pp. 7–11, 2015
2015
Earlier work this paper cites.
T. Herault and Y. Robert, Fault-Tolerance Techniques for High Performance Computing . Springer, 2015
2015
Earlier work this paper cites.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding,” in Machine Learning Systems Workshop, Advances in Neural Information Processing Systems (NIPS) , 2016
2016
Earlier work this paper cites.
Y. Yang, P. Grover, and S. Kar, “Fault-tolerant Distributed Logistic Regression Using Unreliable Components,” in Communication, Control, and Computing (Allerton) , 2016, pp. 940–947
2016
Earlier work this paper cites.
Y. Yang, P. Grover, and S. Kar, “Fault-tolerant parallel linear filtering using compressive sensing,” in IEEE International Symposium on Turbo Codes and Iterative Information Processing (ISTC) , 2016, pp. 201–205
2016
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A Unified Coding Framework for Distributed Computing with Straggling Servers,” in Globecom Workshops (GC Wkshps) , 2016, pp. 1–6
2016
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded Distributed Computing: Straggling Servers and Multistage Dataflows,” in Communication, Control, and Computing (Allerton) , 2016, pp. 164–171
2016
Earlier work this paper cites.
M. Fahim, H. Jeong, F. Haddadpour, S. Dutta, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” in Communication, Control, and Computing (Allerton) , Oct 2017, pp. 1264–1270
2017
Cited alongside, same era.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication,” in Advances In Neural Information Processing Systems (NIPS) , 2017, pp. 4403–4413
2017
Cited alongside, same era.
N. Azian-Ruhi, A. S. Avestimehr, F. Lahouti, and B. Hassibi, “Consensus-based distributed computing,” in Information Theory and Applications Workshop , 2017
2017
Cited alongside, same era.
Y. Yang, P. Grover, and S. Kar, “Computing Linear Transformations With Unreliable Components,” IEEE Transactions on Information Theory , vol. 63, no. 6, pp. 3729–3756, 2017
2017
Cited alongside, same era.
2017
Later among the works it cites.
S. Dutta, V. Cadambe, and P. Grover, “Coded convolution for parallel and distributed computing within a deadline,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2403–2407
2017
Later among the works it cites.
V. Cadambe and P. Grover, “Codes for Distributed Computing: A Tutorial,” IEEE Information Theory Society Newsletter , vol. 67, no. 4, pp. 3–15, Dec. 2017
2017
Later among the works it cites.
K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2418–2422
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Li, S. Supittayapornpong, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded TeraSort,” in IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) , 2017, pp. 389–398
2017
Cited alongside, same era.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient Coding: Avoiding Stragglers in Distributed Learning,” in International Conference on Machine Learning (ICML) , 2017, pp. 3368–3376
2017
Cited alongside, same era.
2017
Cited alongside, same era.
M. Aktas, P. Peng, and E. Soljanin, “Effective Straggler Mitigation: Which Clones Should Attack and When?” ACM SIGMETRICS Performance Evaluation Review , vol. 45, no. 2, pp. 12–14, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
A. Reisizadeh, S. Prakash, R. Pedarsani, and A. S. Avestimehr, “Coded computation over heterogeneous clusters,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2408–2412
2017
Cited alongside, same era.
2017
Cited alongside, same era.
C. Karakus, Y. Sun, and S. Diggavi, “Encoded distributed optimization,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2890–2894
2017
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Transactions on Information Theory , vol. 64, no. 3, pp. 1514–1529, 2018
2018
Closest in time.
S. Li, M. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A Fundamental Tradeoff Between Computation and Communication in Distributed Computing,” IEEE Transactions on Information Theory , vol. 64, no. 1, pp. 109–128, 2018
2018
Closest in time.
M. Aktas, P. Peng, and E. Soljanin, “Straggler Mitigation by Delayed Relaunch of Tasks,” ACM SIGMETRICS Performance Evaluation Review , vol. 45, no. 2, pp. 224–231, 2018
2018
Closest in time.
H. Jeong, T. M. Low, and P. Grover, “Coded FFT and Its Communication Overhead,” Submitted , 2018
2018
Closest in time.
T. Baharav, K. Lee, O. Ocal, and K. Ramchandran, “Straggler-proofing massive-scale distributed matrix multiplication with d-dimensional product codes,” 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
S. Wang, J. Liu, N. Shroff, and P. Yang, “Fundamental limits of coded linear transform,” arXiv preprint arXiv: 1804.09791 , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
S. Dutta, Z. Bai, H. Jeong, T. M. Low, and P. Grover, “A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes,” in IEEE International Symposium on Information Theory (ISIT) - To Appear , 2018
2018
Closest in time.
S. Dutta, Z. Bai, T. M. Low, and P. Grover, “Codenet: Training Large Neural Networks in presence of Soft-Errors,” Submitted , 2018
2018
Closest in time.
S. Dutta, V. Cadambe, and P. Grover, “Short-Dot: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products,” in Advances In Neural Information Processing Systems (NIPS) , 2016, pp. 2092–2100
2092
Closest in time.