arXiv (Cornell University) · 2018 · 13 citations · 29 references
ComputingComputer EngineeringComputer ScienceAlgorithmsDistributed SystemsFault-tolerant ComputingDistributed AlgorithmsDistributed ComputingDistributed Data ProcessingDistributed StorageIterative SolversMatrix ComputationCommunication Cost AnalysisCommunication Cost ModelsCommunication-avoiding AlgorithmsComputational Complexity Of AlgorithmsDistributed ComplexityDistributed Linear AlgebraFault Tolerant AlgorithmsIterative Methods For Linear Systems
We propose a novel distributed iterative linear inverse solver method. Our method, PolyLin, has significantly lower communication cost, both in terms of number of rounds as well as number of bits, in comparison with the state of the art at the cost of higher computational complexity and storage. Our algorithm also has a built-in resilience to straggling and faulty computation nodes. We develop a natural variant of our main algorithm that trades off communication cost for computational complexity. Our method is inspired by ideas in error correcting codes.
29
An Introduction to Numerical Analysis
F. S., Kendall Atkinson · Mathematics of Computation · 1990 · 3.1K citations
Large Scale Distributed Deep Networks
Jay B. Dean, Greg S. Corrado, Rajat Monga et al. · 2012 · 2.9K citations
Parallelized Stochastic Gradient Descent
Martin Zinkevich, Markus Weimer, Lihong Li et al. · 2010 · 1.1K citations
Speeding Up Distributed Machine Learning Using Codes
Kangwook Lee, Maximilian Lam, Ramtin Pedarsani et al. · IEEE Transactions on Information Theory · 2017 · 866 citations · Full text