Distributed and Private Coded Matrix Computation with Flexible Communication Load

A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, Nov. 1979

1979

Earlier work this paper cites.

K.-H. Huang et al. , “Algorithm-based fault tolerance for matrix operations,” IEEE Trans. on Computers , vol. 100, no. 6, pp. 518–528, Jun. 1984

1984

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, Feb. 2013

2013

Earlier work this paper cites.

M. Li, D. G. Andersen, J. W. Park, A. J. Smola, A. Ahmed, V. Josifovski, J. Long, E. J. Shekita, and B.-Y. Su, “Scaling distributed machine learning with the parameter server.” in Proc. of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI , vol. 14, Oct 2014, pp. 583–598

2014

Earlier work this paper cites.

M. Janzamin, H. Sedghi, and A. Anandkumar, “Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods,” arXiv preprint, arXiv:1506.08473 , 2015

Original

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, Dec. 2015

2015

Earlier work this paper cites.

G. Joshi, E. Soljanin, and G. Wornell, “Efficient redundancy techniques for latency reduction in cloud systems,” ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) , vol. 2, no. 2, pp. 12:1–12:30, Apr. 2017

2017

Earlier work this paper cites.

K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Trans. on Inform. Theory , vol. 64, no. 3, pp. 1514–1529, Aug. 2017

2017

Earlier work this paper cites.

Q. Yu, M. Maddah-Ali, and S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in Proc. Advances in Neural Inform. Processing Systems , Dec. 2017, pp. 4403–4413

2017

Earlier work this paper cites.

S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Trans. on Inform. Theory , vol. 64, no. 1, pp. 109–128, Sep. 2017

2017

Cited alongside, same era.

K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” in Proc. IEEE International Symposium on Information Theory (ISIT) , Jun. 2017, pp. 2418–2422

2017

Cited alongside, same era.

M. Fahim, H. Jeong, F. Haddadpour, S. Dutta, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” in Proc. Communication, Control, and Computing (Allerton) , Oct. 2017, pp. 1264–1270

2017

Cited alongside, same era.

R. Frej-Hollanti, O. W. Gnilke, C. Hollanti, and D. Karpuk, “Private information retrieval from coded databases with colluding servers,” SIAM Journal on Applied Algebra and Geometry , pp. 647–664, Nov. 2017

2017

Cited alongside, same era.

J. Kakar, S. Ebadifar, and A. Sezgin, “Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation,” arXiv preprint, arXiv:1810.13006 , 2018

Original

2018

Later among the works it cites.

R. G. D’Oliveira, S. E. Rouayheb, and D. Karpuk, “GASP codes for secure distributed matrix multiplication,” arXiv preprint, arXiv:1812.09962 , 2018

Original

2018

Later among the works it cites.

S. Dutta, M. Fahim, F. Haddadpour, H. Jeong, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” arXiv preprint, arXiv:1801.10292 , 2018

Original

2018

Later among the works it cites.

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 for matrix multiplication,” arXiv preprint arXiv:1811.10751 , 2018

Original

2018

Later among the works it cites.