Fetching the paper…
Reading the bibliography…
In large-scale distributed computing clusters, such as Amazon EC2, there are several types of "system noise" that can result in major degradation of performance: bottlenecks due to limited communication bandwidth, latency due to straggler nodes, etc.
Cambridge university press, 2003
D. J. MacKay and D. J. Mac Kay, Information theory, inference and learning algorithms · 2003
Earlier work this paper cites.
L. Dalcín, R. Paz, and M. Storti, “MPI for Python,” Journal of Parallel and Distributed Computing
2005
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.
M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, “Improving mapreduce performance in heterogeneous environments,” in OSDI
2008
Earlier work this paper cites.
E. Deelman, G. Singh, M. Livny, B. Berriman, and J. Good, “The cost of doing science on the cloud: the montage example,” in High Performance Computing, Networking, Storage and Analysis, 2008. SC 2008. International Conference for
2008
Earlier work this paper cites.
D. Kondo, B. Javadi, P. Malecot, F. Cappello, and D. P. Anderson, “Cost-benefit analysis of cloud computing versus desktop grids.,” in IPDPS
2009
Earlier work this paper cites.
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: cluster computing with working sets,” HotCloud
2010
Earlier work this paper cites.
M. Rudelson and R. Vershynin, “Non-asymptotic theory of random matrices: extreme singular values,” in Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) (In 4 Volumes) Vol. I: Plenary Lectures and Ceremonies Vols. II–IV: Invited Lectures
2010
Earlier work this paper cites.
F. Bonomi, R. Milito, J. Zhu, and S. Addepalli, “Fog computing and its role in the internet of things,” in Proceedings of the first edition of the MCC workshop on Mobile cloud computing
2012
Earlier work this paper cites.
S. Yi, A. Andrzejak, and D. Kondo, “Monetary cost-aware checkpointing and migration on amazon cloud spot instances,” IEEE Transactions on Services Computing
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. Su, J. Li, Q. Huang, X. Huang, K. Shuang, and J. Wang, “Cost-efficient task scheduling for executing large programs in the cloud,” Parallel Computing
2013
Earlier work this paper cites.
G. Liang and U. C. Kozat, “Tofec: achieving optimal throughput-delay trade-off of cloud storage using erasure codes,” in IEEE INFOCOM 2014-IEEE Conference on Computer Communications
2014
Earlier work this paper cites.
Q. Pu, G. Ananthanarayanan, P. Bodik, S. Kandula, A. Akella, P. Bahl, and I. Stoica, “Low latency geo-distributed data analytics,” ACM SIGCOMM Computer Communication Review
2015
Earlier work this paper cites.
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
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
2015
Cited alongside, same era.
M. Malawski, G. Juve, E. Deelman, and J. Nabrzyski, “Algorithms for cost-and deadline-constrained provisioning for scientific workflow ensembles in iaas clouds,” Future Generation Computer Systems
2015
Cited alongside, same era.
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.
K. Lee, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Coded computation for multicore setups,” in Information Theory (ISIT), 2017 IEEE International Symposium on
2017
Closest in time.
G. Suh, K. Lee, and C. Suh, “Matrix sparsification for coded matrix multiplication,” in Communication, Control, and Computing (Allerton), 2017 55th Annual Allerton Conference on
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.
C. Karakus, Y. Sun, S. Diggavi, and W. Yin, “Straggler mitigation in distributed optimization through data encoding,” in Advances in Neural Information Processing Systems
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
N. S. Ferdinand and S. C. Draper, “Anytime coding for distributed computation,” in Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton Conference on
2016
Cited alongside, same era.
A. Reisizadeh, S. Prakash, R. Pedarsani, and S. Avestimehr, “Coded computation over heterogeneous clusters,” in IEEE International Symposium on Information Theory (ISIT), 2017
2017
Cited alongside, same era.
S. Li, S. Supittayapornpong, M. A. Maddah-Ali, and S. Avestimehr, “Coded terasort,” in Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2017 IEEE International
2017
Cited alongside, same era.
2017
Cited alongside, same era.
M. Kiamari, C. Wang, and A. S. Avestimehr, “On heterogeneous coded distributed computing,” in GLOBECOM 2017-2017 IEEE Global Communications Conference
2017
Cited alongside, same era.
Y. H. Ezzeldin, M. Karmoose, and C. Fragouli, “Communication vs distributed computation: an alternative trade-off curve,” in Information Theory Workshop (ITW), 2017 IEEE
2017
Cited alongside, same era.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding: avoiding stragglers in distributed learning,” in International Conference on Machine Learning
2017
Cited alongside, same era.
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
Cited alongside, same era.
2017
Closest in time.
M. F. Aktas, P. Peng, and E. Soljanin, “Effective straggler mitigation: which clones should attack and when?,” ACM SIGMETRICS Performance Evaluation Review
2017
Closest in time.
S. Dutta, V. Cadambe, and P. Grover, “Coded convolution for parallel and distributed computing within a deadline,” in Information Theory (ISIT), 2017 IEEE International Symposium on
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.
[Online], “Amazon EC2 pricing.” https://aws.amazon.com/ec2/pricing/ · 2017
Closest in time.
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
2018
Closest in time.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Transactions on Information Theory
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
M. Aliasgari, J. Kliewer, and O. Simeone, “Coded computation against straggling decoders for network function virtualization,” in 2018 IEEE International Symposium on Information Theory (ISIT)
2018
Closest in time.