Fundamental Limits of Coded Linear Transform

P. Erdos and A. Renyi, “On random matrices,” Magyar Tud. Akad. Mat. Kutató Int. Közl , vol. 8, no. 455-461, p. 1964, 1964

1964

Earlier work this paper cites.

J. T. Schwartz, “Fast probabilistic algorithms for verification of polynomial identities,” Journal of the ACM (JACM) , vol. 27, no. 4, pp. 701–717, 1980

1980

Earlier work this paper cites.

D. W. Walkup, “Matchings in random regular bipartite digraphs,” Discrete Mathematics , vol. 31, no. 1, pp. 59–64, 1980

1980

Earlier work this paper cites.

O. S. Center, “Ohio supercomputer center,” http://osc.edu/ark:/19495/f5s1ph73 , 1987

1987

Earlier work this paper cites.

M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes,” IEEE Transactions on Information Theory , vol. 47, no. 2, pp. 569–584, 2001

2001

Earlier work this paper cites.

M. Luby, “Lt codes,” in Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on . IEEE, 2002, pp. 271–280

2002

Earlier work this paper cites.

J. Dean and S. Ghemawat, “Mapreduce: simplified data processing on large clusters,” Communications of the ACM , vol. 51, no. 1, pp. 107–113, 2008

2008

Cited alongside, same era.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: Cluster computing with working sets.” HotCloud , vol. 10, no. 10-10, p. 95, 2010

2010

Cited alongside, same era.

T. A. Davis and Y. Hu, “The university of florida sparse matrix collection,” ACM Transactions on Mathematical Software (TOMS) , vol. 38, no. 1, p. 1, 2011

2011

Cited alongside, same era.

J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM , vol. 56, no. 2, pp. 74–80, 2013

2013

Cited alongside, same era.

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 , 2016, pp. 2100–2108

K. Lee, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Coded computation for multicore setups,” in Information Theory (ISIT), 2017 IEEE International Symposium on . IEEE, 2017, pp. 2413–2417

2017

Later among the works it cites.

R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding: Avoiding stragglers in distributed learning,” in International Conference on Machine Learning , 2017, pp. 3368–3376

2017

Later among the works it cites.

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

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 Transactions on Information Theory , vol. 64, no. 1, pp. 109–128, 2018

2018

Closest in time.