Fetching the paper…
Reading the bibliography…
We consider a distributed computing framework where the distributed nodes have different communication capabilities, motivated by the heterogeneous networks in data centers and mobile edge computing systems.
1902
Earlier work this paper cites.
J. Dean and S. Ghemawat, “MapReduce: simplified data processing on large clusters,” Commun. of the ACM , vol. 51, no. 1, pp. 107–113, Jan. 2008
2008
Earlier work this paper cites.
K. Shvachko, H. Kuang, P. Radia, and R. Chansler, “The Hadoop distributed file system,” in Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) , May 2010, pp. 1–10
2010
Earlier work this paper cites.
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: cluster computing with working sets,” in Proceedings of the 2nd USENIX conference on Hot topics in cloud computing , Jun. 2010, pp. 10–10
2010
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded MapReduce,” in Proc. Allerton Conf. Communication, Control and Computing , Sep. 2015, pp. 964 – 971
2015
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded distributed computing: Straggling servers and multistage dataflows,” in Proc. Allerton Conf. Communication, Control and Computing , Sep. 2016, pp. 164 – 171
2016
Earlier work this paper cites.
S. Li, Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded distributed computing: Fundamental limits and practical challenges,” in Proc. Asilomar Conf. Signals, Systems and Computers , Nov. 2016, pp. 509 – 513
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,” in Advances In Neural Information Processing Systems (NIPS) , Dec. 2016
2016
Earlier work this paper cites.
M. Attia and R. Tandon, “Information theoretic limits of data shuffling for distributed learning,” in Proc. IEEE Global Conf. Communications (GLOBECOM) , Dec. 2016
2016
Earlier work this paper cites.
M. Attia and R. Tandon, “On the worst-case communication overhead for distributed data shuffling,” in Proc. Allerton Conf. Communication, Control and Computing , Sep. 2016, pp. 961 – 968
2016
Earlier work this paper cites.
Q. Yu, S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “How to optimally allocate resources for coded distributed computing?” in Proc. IEEE Int. Conf. Communications (ICC) , May 2017
2017
Earlier work this paper cites.
Y. Ezzeldin, M. Karmoose, and C. Fragouli, “Communication vs distributed computation: an alternative trade-off curve,” in Proc. IEEE Inf. Theory Workshop (ITW) , Nov. 2017
2017
Earlier work this paper cites.
2017
Cited alongside, same era.
——, “Coded convolution for parallel and distributed computing within a deadline,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2017, pp. 2403 – 2407
2017
Cited alongside, same era.
K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2017, pp. 2418 – 2422
2017
Cited alongside, same era.
C. Karakus, Y. Sun, and S. Diggavi, “Encoded distributed optimization,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2017, pp. 2890 – 2894
2017
Cited alongside, same era.
A. Reisizadeh and R. Pedarsani, “Latency analysis of coded computation schemes over wireless networks,” in Proc. Allerton Conf. Communication, Control and Computing , Oct. 2017, pp. 1256 – 1263
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, pp. 109 – 128, Jan. 2018
2018
Closest in time.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Trans. Inf. Theory , vol. 64, no. 3, pp. 1514 – 1529, Mar. 2018
2018
Closest in time.
2018
Closest in time.
S. Prakash, A. Reisizadeh, R. Pedarsani, and A. S. Avestimehr, “Coded computing for distributed graph analytics,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2018
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
R. Tandon, Q. Lei, A. Dimakis, and N. Karampatziakis, “Gradient coding: Avoiding stragglers in distributed learning,” in Proceedings of the 34th International Conference on Machine Learning , 2017
2017
Cited alongside, same era.
L. Song, C. Fragouli, and T. Zhao, “A pliable index coding approach to data shuffling,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2017, pp. 2558 – 2562
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Y. Mao, C. You, J. Zhang, K. Huang, and K. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE Communications Surveys and Tutorials , vol. 19, no. 4, pp. 2322 – 2358, 2017
2017
Cited alongside, same era.
P. Mach and Z. Becvar, “Mobile edge computing: A survey on architecture and computation offloading,” IEEE Communications Surveys and Tutorials , vol. 19, no. 3, pp. 1628 – 1656, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
E. Parrinello, E. Lampiris, and P. Elia, “Coded distributed computing with node cooperation substantially increases speedup factors,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2018
2018
Closest in time.
K. Li, M. Tao, and Z. Chen, “Exploiting computation replication in multi-user multi-server mobile edge computing networks,” in Proc. IEEE Global Conf. Communications (GLOBECOM) , Dec. 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
A. Reisizadeh, S. Prakash, R. Pedarsani, and S. Avestimehr, “Coded computation over heterogeneous clusters,” IEEE Trans. Inf. Theory , vol. 65, no. 7, pp. 4227–4242, Jul. 2019
2019
Closest in time.
J. Zhang and O. Simeone, “Improved latency-communication trade-off for map-shuffle-reduce systems with stragglers,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP) , May 2019
2019
Closest in time.
F. Li, J. Chen, and Z. Wang, “Wireless MapReduce distributed computing,” IEEE Trans. Inf. Theory , pp. 1–1, Jun. 2019
2019
Closest in time.