Fetching the paper…
Reading the bibliography…
This paper has two contributions.
W. S. McCulloch and W. Pitts, “A logical calculus of the ideas immanent in nervous activity,” The bulletin of mathematical biophysics , vol. 5, no. 4, pp. 115–133, 1943
1943
Earlier work this paper cites.
J. Von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” Automata Studies , vol. 34, pp. 43–98, 1956
1956
Earlier work this paper cites.
H. B. Barlow, “Possible principles underlying the transformations of sensory messages,” Sensory Communication , pp. 217–234, 1961
1961
Earlier work this paper cites.
M. G. Taylor, “Reliable Information Storage in Memories Designed from Unreliable Components,” Bell Syst. Tech. J. , vol. 47, no. 10, pp. 2299–2337, 1968
1968
Earlier work this paper cites.
K. H. Huang and J. A. Abraham, “Algorithm-Based Fault Tolerance for Matrix Operations,” IEEE Trans. on Computers , vol. 100, no. 6, pp. 518–528, 1984
1984
Earlier work this paper cites.
D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by back-propagating errors,” Nature , vol. 323, pp. 533–536, 1986
1986
Earlier work this paper cites.
J. Y. Jou and J. Abraham, “Fault-tolerant FFT networks,” IEEE Transactions on Computers , vol. 37, no. 5, pp. 548–561, May 1988
1988
Earlier work this paper cites.
V. P. Nelson, “Fault-tolerant computing: Fundamental concepts,” IEEE Computer , vol. 23, no. 7, pp. 19–25, 1990
1990
Earlier work this paper cites.
R. A. van de Geijn and J. Watts, “SUMMA: Scalable Universal Matrix Multiplication Algorithm,” Austin, TX, USA, Tech. Rep., 1995
1995
Earlier work this paper cites.
J. F. Ziegler, “Terrestrial cosmic rays,” IBM journal of research and development , vol. 40, no. 1, pp. 19–39, 1996
1996
Earlier work this paper cites.
T. Baharav, K. Lee, O. Ocal, and K. Ramchandran, “Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1993–1997
1997
Earlier work this paper cites.
J. Bruck et al. , “Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems,” IEEE Trans. on Parallel and Distributed Systems , vol. 8, no. 11, pp. 1143–1156, 1997
1997
Earlier work this paper cites.
G. Redinbo, “Generalized algorithm-based fault tolerance: error correction via Kalman estimation,” IEEE Transactions on Computers , vol. 47, no. 6, pp. 639–655, 1998
1998
Earlier work this paper cites.
E. J. Candes and T. Tao, “Decoding by Linear Programming,” IEEE Trans. on Information Theory , vol. 51, no. 12, pp. 4203–4215, 2005
2005
Earlier work this paper cites.
V. Guruswami, “Algorithmic results in list decoding,” Foundations and Trends® in Theoretical Computer Science , vol. 2, no. 2, pp. 107–195, 2007
2007
Earlier work this paper cites.
X. Li, K. Shen, M. C. Huang, and L. Chu, “A Memory Soft Error Measurement on Production Systems,” in USENIX Annual Technical Conference , 2007, pp. 275––280
2007
Earlier work this paper cites.
E. Chan, M. Heimlich, A. Purkayastha, and R. Van De Geijn, “Collective communication: theory, practice, and experience,” Concurrency and Computation: Practice and Experience , vol. 19, no. 13, pp. 1749–1783, 2007
2007
Earlier work this paper cites.
C. Poultney, S. Chopra, Y. L. Cun et al. , “Efficient learning of sparse representations with an energy-based model,” in Advances in Neural Information Processing Systems (NIPS) , 2007, pp. 1137–1144
2007
Earlier work this paper cites.
K. Bergman, S. Borkar, D. Campbell, W. Carlson, W. Dally, M. Denneau, P. Franzon, W. Harrod, K. Hill, J. Hiller et al. , “Exascale computing study: Technology challenges in achieving exascale systems,” DARPA IPTO, Tech. Rep., 2008
2008
Earlier work this paper cites.
M. Ranzato, Y. L. Boureau, and Y. LeCun, “Sparse feature learning for deep belief networks,” in Advances in Neural Information Processing Systems (NIPS) , vol. 20, 01 2008, pp. 1185–1192
2008
Earlier work this paper cites.
P. Vincent, H. Larochelle, Y. Bengio, and P.-A. Manzagol, “Extracting and composing robust features with denoising autoencoders,” in International Conference on Machine learning (ICML) . ACM, 2008, pp. 1096–1103
2008
Earlier work this paper cites.
W. Ryan and S. Lin, Channel codes: Classical and Modern . Cambridge University Press, 2009
2009
Earlier work this paper cites.
J. A. Tropp and S. J. Wright, “Computational methods for sparse solution of linear inverse problems,” Proceedings of the IEEE , vol. 98, no. 6, pp. 948–958, 2010
2010
Earlier work this paper cites.
K. Ferreira, J. Stearley, J. H. Laros III, R. Oldfield, K. Pedretti, R. Brightwell, R. Riesen, P. G. Bridges, and D. Arnold, “Evaluating the viability of process replication reliability for exascale systems,” in International Conference for High Performance Computing, Networking, Storage and Analysis . ACM, 2011, p. 44
2011
Earlier work this paper cites.
S. Sreenivasan and I. Fiete, “Error correcting analog codes in the brain: beyond classical population coding for exponentially precise computation,” Nature Neuroscience , vol. 14, pp. 1330–1337, 2011
2011
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM , vol. 56, no. 2, pp. 74–80, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
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 , vol. 32, no. 5, pp. 989–997, 2014
2014
Earlier work this paper cites.
D. Wang, G. Joshi, and G. Wornell, “Efficient Task Replication for Fast Response Times in Parallel Computation,” in ACM SIGMETRICS Performance Evaluation Review , vol. 42, no. 1, 2014, pp. 599–600
2014
Cited alongside, same era.
A. Bouteiller, T. Herault, G. Bosilca, P. Du, and J. Dongarra, “Algorithm-based fault tolerance for dense matrix factorizations, multiple failures and accuracy,” ACM Transactions on Parallel Computing , vol. 1, no. 2, p. 10, 2015
2015
Cited alongside, same era.
D. Wang, G. Joshi, and G. Wornell, “Using Straggler Replication to Reduce Latency in Large-scale Parallel Computing,” in ACM SIGMETRICS Performance Evaluation Review , vol. 43, no. 3, 2015, pp. 7–11
2015
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded mapreduce,” in Communication, Control, and Computing (Allerton) , 2015, pp. 964–971
2015
Cited alongside, same era.
C. Karakus, Y. Sun, and S. Diggavi, “Encoded distributed optimization,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2890–2894
2017
Later among the works it cites.
C. Karakus, Y. Sun, S. Diggavi, and W. Yin, “Straggler Mitigation in Distributed Optimization through Data Encoding,” in Advances in Neural Information Processing Systems (NIPS) , 2017, pp. 5440–5448
2017
Later among the works it cites.
Y. Yang, P. Grover, and S. Kar, “Coded Distributed Computing for Inverse Problems,” in Advances in Neural Information Processing Systems (NIPS) , 2017, pp. 709–719
2017
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Geist, “Supercomputing’s monster in the closet,” IEEE Spectrum , vol. 53, no. 3, pp. 30–35, 2016
2016
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 (ISIT) , 2016, pp. 1143–1147
2016
Cited alongside, same era.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding,” in Machine Learning Systems Workshop, Advances in Neural Information Processing Systems (NIPS) , 2016
2016
Cited alongside, same era.
Y. Yang, P. Grover, and S. Kar, “Fault-tolerant distributed logistic regression using unreliable components,” in Communication, Control, and Computing (Allerton) , 2016, pp. 940–947
2016
Cited alongside, same era.
Y. Yang, P. Grover, and S. Kar, “Fault-tolerant parallel linear filtering using compressive sensing,” in IEEE International Symposium on Turbo Codes and Iterative Information Processing (ISTC) , 2016, pp. 201–205
2016
Cited alongside, same era.
Y. Yang, P. Grover, and S. Kar, “Computing Linear Transformations With Unreliable Components,” in IEEE International Symposium on Information Theory (ISIT) , 2016
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A Unified Coding Framework for Distributed Computing with Straggling Servers,” in Globecom Workshops (GC Wkshps) , 2016, pp. 1–6
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded Distributed Computing: Straggling Servers and Multistage Dataflows,” in Communication, Control, and Computing (Allerton) , 2016, pp. 164–171
2016
Cited alongside, same era.
K. Lee, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Coded computation for multicore setups,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 2413–2417
2017
Later among the works it cites.
G. Suh, K. Lee, and C. Suh, “Matrix sparsification for coded matrix multiplication,” in Communication, Control, and Computing (Allerton) , 2017, pp. 1271–1278
2017
Later among the works it cites.
2017
Later among the works it cites.
S. Dutta, Z. Bai, H. Jeong, T. M. Low, and P. Grover, “A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1585–1589
2018
Closest in time.
S. Dutta, Z. Bai, T. M. Low, and P. Grover, “Codenet: Training Large Neural Networks in presence of Soft-Errors,” Submitted , 2018
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 , vol. 64, no. 3, pp. 1514–1529, 2018
2018
Closest in time.
S. Li, M. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A Fundamental Tradeoff Between Computation and Communication in Distributed Computing,” IEEE Transactions on Information Theory , vol. 64, no. 1, pp. 109–128, 2018
2018
Closest in time.
M. Aktas, P. Peng, and E. Soljanin, “Straggler Mitigation by Delayed Relaunch of Tasks,” ACM SIGMETRICS Performance Evaluation Review , vol. 45, no. 2, pp. 224–231, 2018
2018
Closest in time.
H. Jeong, T. M. Low, and P. Grover, “Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm,” Communication, Control, and Computing (Allerton) , 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
S. Wang, J. Liu, N. Shroff, and P. Yang, “Fundamental Limits of Coded Linear Transform,” arXiv preprint arXiv: 1804.09791 , 2018
2018
Closest in time.
A. Severinson, A. G. i Amat, and E. Rosnes, “Block-diagonal and lt codes for distributed computing with straggling servers,” IEEE Transactions on Communications , 2018
2018
Closest in time.
2018
Closest in time.
F. Haddadpour and V. R. Cadambe, “Codes for distributed finite alphabet matrix-vector multiplication,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1625–1629
2018
Closest in time.
2018
Closest in time.
Y. Yang, P. Grover, and S. Kar, “Coding for a single sparse inverse problem,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1575–1579
2018
Closest in time.
N. Ferdinand and S. C. Draper, “Hierarchical coded computation,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 1620–1624
2018
Closest in time.
2018
Closest in time.
U. Sheth, S. Dutta, M. Chaudhari, H. Jeong, Y. Yang, J. Kohonen, T. Roos, and P. Grover, “An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation,” in IEEE Big Data (Short Paper) , 2018
2018
Closest in time.
H. Jeong, F. Ye, and P. Grover, “Locally Recoverable Coded Matrix Multiplication,” in Communication, Control, and Computing (Allerton) , 2018
2018
Closest in time.
2018
Closest in time.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,” in IEEE International Symposium on Information Theory (ISIT) , 2018, pp. 2022 – 2026
2026
Closest in time.
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) , 2016, pp. 2092–2100
2092
Closest in time.