Compressed Coded Distributed Computing

J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Sixth USENIX OSDI , Dec. 2004

2004

Earlier work this paper cites.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: cluster computing with working sets,” 2nd USENIX HotCloud , vol. 10, p. 10, June 2010

2010

Earlier work this paper cites.

B. Recht, C. Re, S. Wright, and F. Niu, “Hogwild: A lock-free approach to parallelizing stochastic gradient descent,” NIPS , pp. 693–701, 2011

2011

Earlier work this paper cites.

M. Chowdhury, M. Zaharia, J. Ma, M. I. Jordan, and I. Stoica, “Managing data transfers in computer clusters with orchestra,” ACM SIGCOMM Computer Communication Review , vol. 41, no. 4, Aug. 2011

2011

Earlier work this paper cites.

F. Seide, H. Fu, J. Droppo, G. Li, and D. Yu, “1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns,” Interspeech , 2014

2014

Earlier work this paper cites.

S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded MapReduce,” 53rd Allerton Conference , Sept. 2015

2015

Earlier work this paper cites.

K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” IEEE CVPR , pp. 770–778, 2016

2016

Earlier work this paper cites.

S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded distributed computing: Straggling servers and multistage dataflows,” 54th Allerton Conference , Sept. 2016

2016

Earlier work this paper cites.

S. Dutta, V. Cadambe, and P. Grover, “Short-dot: Computing large linear transforms distributedly using coded short dot products,” NIPS , pp. 2100–2108, 2016

2016

Earlier work this paper cites.

R. Tandon, Q. Lei, A. Dimakis, and N. Karampatziakis, “Gradient coding,” NIPS Machine Learning Systems Workshop , 2016

2016

Cited alongside, same era.

S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A unified coding framework for distributed computing with straggling servers,” IEEE NetCod , Dec. 2016

2016

Cited alongside, same era.

M. A. Attia and R. Tandon, “Information theoretic limits of data shuffling for distributed learning,” IEEE GLOBECOM , Dec. 2016

Original

2016

Cited alongside, same era.

S. Li, S. Supittayapornpong, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded terasort,” IPDPS ParLearning Workshop , May 2017

2017

Cited alongside, same era.

S. Li, Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “A scalable framework for wireless distributed computing,” IEEE/ACM Trans. Netw. , vol. 25, no. 5, pp. 2643–2654, Oct. 2017

W. Wen, C. Xu, F. Yan, C. Wu, Y. Wang, Y. Chen, and H. Li, “Terngrad: Ternary gradients to reduce communication in distributed deep learning,” NIPS , pp. 1508–1518, 2017

2017

Later among the works it cites.

——, “Coding for distributed fog computing,” IEEE Commun. Mag. , vol. 55, no. 4, Apr. 2017

2017

Later among the works it cites.

Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” NIPS , pp. 4406–4416, 2017

2017

Later among the works it cites.

L. Song, C. Fragouli, and T. Zhao, “A pliable index coding approach to data shuffling,” IEEE ISIT , pp. 2558–2562, 2017

2017

Later among the works it 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. Inf. Theory , vol. 64, no. 1, Jan. 2018