Fetching the paper…
Reading the bibliography…
We propose a unified coded framework for distributed computing with straggling servers, by introducing a tradeoff between "latency of computation" and "load of communication" for some linear computation tasks.
B. C. Arnold, N. Balakrishnan, and H. N. Nagaraja, A first course in order statistics . Siam, 1992, vol. 54
1992
Earlier work this paper cites.
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inf. Theory , vol. 46, no. 4, July 2000
2000
Earlier work this paper cites.
J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Sixth USENIX OSDI , Dec. 2004
2004
Earlier work this paper cites.
Y. Birk and T. Kol, “Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients,” IEEE Trans. Inf. Theory , vol. 52, no. 6, pp. 2825–2830, June 2006
2006
Earlier work this paper cites.
M. Zaharia, M. Chowdhury, M. J. Franklin, S. Shenker, and I. Stoica, “Spark: cluster computing with working sets,” 2nd USENIX HotCloud , vol. 10, p. 10, June 2010
2010
Earlier work this paper cites.
Z. Bar-Yossef, Y. Birk, T. Jayram, and T. Kol, “Index coding with side information,” IEEE Trans. Inf. Theory , vol. 57, no. 3, Mar. 2011
2011
Earlier work this paper cites.
M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Trans. Inf. Theory , vol. 60, no. 5, Mar. 2014
2014
Cited alongside, same era.
——, “Decentralized coded caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Trans. Netw. , Apr. 2014
2014
Cited alongside, same era.
——, “Coded MapReduce,” 53rd Allerton Conference , Sept. 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental tradeoff between computation and communication in distributed computing,” IEEE ISIT , July 2016
2016
Closest in time.
——, “Speeding up distributed machine learning using codes,” IEEE ISIT , July 2016
2016
Closest in time.
2016
Closest in time.
——, “Edge-facilitated wireless distributed computing,” IEEE GLOBECOM , Dec. 2016
2016
Closest in time.
M. Ji, G. Caire, and A. F. Molisch, “Fundamental limits of caching in wireless D2D networks,” IEEE Trans. Inf. Theory , Feb. 2016
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…