Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication

R. Singleton, “Maximum distance q-nary codes,” IEEE Transactions on Information Theory

1964

Earlier work this paper cites.

K.-H. Huang and J. A. Abraham, “Algorithm-based fault tolerance for matrix operations,” IEEE Transactions on Computers

1984

Earlier work this paper cites.

J.-Y. Jou and J. A. Abraham, “Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures,” Proceedings of the IEEE

1986

Earlier work this paper cites.

J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Sixth USENIX Symposium on Operating System Design and Implementation

2004

Earlier work this paper cites.

Cambridge University Press, 2006

R. Roth, Introduction to coding theory · 2006

Earlier work this paper cites.

S. Baktir and B. Sunar, “Achieving efficient polynomial multiplication in fermat fields using the fast fourier transform,” in Proceedings of the 44th annual Southeast regional conference

2006

Earlier work this paper cites.

M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, “Improving MapReduce performance in heterogeneous environments,” OSDI

2008

Earlier work this paper cites.

F. Didier, “Efficient erasure decoding of reed-solomon codes,” arXiv preprint arXiv:0901.1886

Original

2009

Cited alongside, same era.

M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: cluster computing with working sets,” in Proceedings of the 2nd USENIX HotCloud

2010

Cited alongside, same era.

K. S. Kedlaya and C. Umans, “Fast polynomial factorization and modular composition,” SIAM Journal on Computing

2011

Cited alongside, same era.

J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM

2013

Cited alongside, same era.

K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” e-print arXiv:1512.02673

Original

2015

Cited alongside, same era.

R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding,” arXiv preprint arXiv:1612.03301

Original

2016

Later among the works it cites.

A. Reisizadehmobarakeh, S. Prakash, R. Pedarsani, and S. Avestimehr, “Coded computation over heterogeneous clusters,” arXiv preprint arXiv:1701.05973

Original

2017

Closest in time.

S. Dutta, V. Cadambe, and P. Grover, “Coded convolution for parallel and distributed computing within a deadline,” arXiv preprint arXiv:1705.03875

Original

2017

Closest in time.

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

2017

Closest in time.

Q. Yu, S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “How to optimally allocate resources for coded distributed computing?,” in 2017 IEEE International Conference on Communications (ICC)