Fetching the paper…
Reading the bibliography…
Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers.
MIT press, 1972
W. W. Peterson and E. J. Weldon, Error-correcting codes · 1972
Earlier work this paper cites.
A. M. Mood, F. A. Graybill, and D. C. Boes, “Introduction to the theory of statistics, 3rd edition.,” 1974
1974
Earlier work this paper cites.
K.-H. Huang et al
1984
Earlier work this paper cites.
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of symbolic computation
1990
Earlier work this paper cites.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.,” tech. rep., Stanford InfoLab, 1999
1999
Earlier work this paper cites.
T. H. Haveliwala, “Topic-sensitive pagerank,” in Proceedings of the 11th international conference on World Wide Web
2002
Earlier work this paper cites.
SIAM, 2003
Y. Saad, Iterative methods for sparse linear systems · 2003
Earlier work this paper cites.
J. Dean and S. Ghemawat, “Mapreduce: simplified data processing on large clusters,” Communications of the ACM
2008
Earlier work this paper cites.
A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, “Network coding for distributed storage systems,” IEEE Transactions on Information Theory
2010
Earlier work this paper cites.
L. Huang, S. Pawar, H. Zhang, and K. Ramchandran, “Codes can reduce queueing delay in data centers,” in IEEE International Symposium on Information Theory
2012
Earlier work this paper cites.
JHU Press, 2012
G. H. Golub and C. F. Van Loan, Matrix computations · 2012
Earlier work this paper cites.
J. Leskovec and J. J. Mcauley, “Learning to discover social circles in ego networks,” in Advances in neural information processing systems
2012
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM
2013
Earlier work this paper cites.
S. K. Narang, A. Gadde, E. Sanou, and A. Ortega, “Localized iterative methods for interpolation in graph structured data,” in 2013 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
2013
Earlier work this paper cites.
M. Sathiamoorthy, M. Asteris, D. Papailiopoulos, A. G. Dimakis, R. Vadali, S. Chen, and D. Borthakur, “Xoring elephants: Novel erasure codes for big data,” in Proceedings of the VLDB Endowment
2013
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine
2013
Cited alongside, same era.
A. Sandryhaila and J. Moura, “Discrete signal processing on graphs,” IEEE transactions on signal processing
2013
Cited alongside, same era.
H. Zhang and F. Ding, “On the kronecker products and their applications,” Journal of Applied Mathematics
2013
Cited alongside, same era.
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
2014
Cited alongside, same era.
D. Wang, G. Joshi, and G. Wornell, “Efficient task replication for fast response times in parallel computation,” in ACM SIGMETRICS Performance Evaluation Review
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A unified coding framework for distributed computing with straggling servers,” 2016 Workshop on Network Coding and Applications
2016
Later among the works it cites.
M. Haikin and R. Zamir, “Analog coding of a source with erasures,” in IEEE International Symposium on Information Theory
2016
Later among the works it cites.
S. Chen, Y. Yang, C. Faloutsos, and J. Kovacevic, “Monitoring manhattan’s traffic at 5 intersections?,” in IEEE 2016 GlobalSIP Conference on Signal and Information Processing (GlobalSIP)
2016
Later among the works it cites.
Y. Yang, P. Grover, and S. Kar, “Coding for lossy function computation: Analyzing sequential function computation with distortion accumulation,” in 2016 IEEE International Symposium on Information Theory (ISIT)
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
D. Wang, G. Joshi, and G. Wornell, “Using straggler replication to reduce latency in large-scale parallel computing,” ACM SIGMETRICS Performance Evaluation Review
2015
Cited alongside, same era.
X. Wang, P. Liu, and Y. Gu, “Local-set-based graph signal reconstruction,” IEEE Transactions on Signal Processing
2015
Cited alongside, same era.
S. Chen, R. Varma, A. Sandryhaila, and J. Kovačević, “Discrete signal processing on graphs: Sampling theory,” IEEE Transactions on Signal Processing
2015
Cited alongside, same era.
M. A. Maddah-Ali and U. Niesen, “Decentralized coded caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Transactions on Networking
2015
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded mapreduce,” in Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on
2015
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” in IEEE International Symposium on Information Theory
2016
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
Cited alongside, same era.
Y. Yang, P. Grover, and S. Kar, “Fault-tolerant distributed logistic regression using unreliable components,” in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
2016
Later among the works it cites.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding: Avoiding stragglers in synchronous gradient descent,” stat
2017
Closest in time.
A. Reisizadehmobarakeh, S. Prakash, R. Pedarsani, and S. Avestimehr, “Coded computation over heterogeneous clusters,” IEEE International Symposium on Information Theory
2017
Closest in time.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coding for distributed fog computing,” IEEE Communications Magazine
2017
Closest in time.
2017
Closest in time.
K. Lee, N. B. Shah, L. Huang, and K. Ramchandran, “The MDS queue: Analysing the latency performance of erasure codes,” IEEE Transactions on Information Theory
2017
Closest in time.
K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” IEEE International Symposium on Information Theory
2017
Closest in time.
K. Lee, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Coded computation for multicore setups,” IEEE International Symposium on Information Theory
2017
Closest in time.
N. Azian-Ruhi, S. Avestimehr, F. Lahouti, and B. Hassibi, “Consensus-based distributed computing,” in Information Theory and Applications Workshop
2017
Closest in time.
Y. Yang, P. Grover, and S. Kar, “Computing linear transformations with unreliable components,” IEEE Transactions on Information Theory
2017
Closest in time.