{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T22:33:26Z","timestamp":1777761206077,"version":"3.51.4"},"reference-count":175,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8,20]]},"abstract":"<jats:p>We introduce the concept of \u201ccoded computing\u201d, a novel computing paradigm that utilizes coding theory to effectively inject and leverage data\/computation redundancy to mitigate several fundamental bottlenecks in large-scale distributed computing, namely communication bandwidth, straggler\u2019s (i.e., slow or failing nodes) delay, privacy and security bottlenecks. More specifically, for MapReduce based distributed computing structures, we propose the \u201cCoded Distributed Computing\u201d (CDC) scheme, which injects redundant computations across the network in a structured manner, such that in-network coding opportunities are enabled to substantially slash the communication load to shuffle the intermediate computation results. We prove that CDC achieves the optimal tradeoff between computation and communication, and demonstrate its impact on a wide range of distributed computing systems from cloud-based datacenters to mobile edge\/fog computing platforms.<\/jats:p>\n                  <jats:p>Secondly, to alleviate the straggler effect that prolongs the executions of distributed machine learning algorithms, we utilize the ideas from error correcting codes to develop \u201cPolynomial Codes\u201d for computing general matrix algebra, and \u201cLagrange Coded Computing\u201d (LCC) for computing arbitrary multivariate polynomials. The core idea of these proposed schemes is to apply coding to create redundant data\/computation scattered across the network, such that completing the overall computation task only requires a subset of the network nodes returning their local computation results. We demonstrate the optimality of Polynomial Codes and LCC in minimizing the computation latency, by proving that they require the least number of nodes to return their results.<\/jats:p>\n                  <jats:p>Finally, we illustrate the role of coded computing in providing security and privacy in distributed computing and machine learning. In particular, we consider the problems of secure multiparty computing (MPC) and privacy-preserving machine learning, and demonstrate how coded computing can be leveraged to provide efficient solutions to these critical problems and enable substantial improvements over the state of the art.<\/jats:p>\n                  <jats:p>To illustrate the impact of coded computing on real world applications and systems, we implement the proposed coding schemes on cloud-based distributed computing systems, and significantly improve the run-time performance of important benchmarks including distributed sorting, distributed training of regression models, and privacy-preserving training for image classification. Throughout this monograph, we also highlight numerous open problems and exciting research directions for future work on coded computing.<\/jats:p>","DOI":"10.1561\/0100000103","type":"journal-article","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T08:10:44Z","timestamp":1592554244000},"page":"1-148","source":"Crossref","is-referenced-by-count":47,"title":["Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning"],"prefix":"10.1108","volume":"17","author":[{"given":"Songze","family":"Li","sequence":"first","affiliation":[{"name":"University of Southern California ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salman","family":"Avestimehr","sequence":"additional","affiliation":[{"name":"University of Southern California ,","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"2026032712174878700_ref001","first-page":"1","volume-title":"Local partial clique and cycle covers for index coding","author":"Agarwal","year":"2016"},{"issue":"4","key":"2026032712174878700_ref002","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","article-title":"Network information flow","volume":"46","author":"Ahlswede","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712174878700_ref003","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/2189750.2150984","article-title":"Tarazu: Optimizing MapReduce on heterogeneous clusters","volume":"40","author":"Ahmad","year":"2012","journal-title":"ACM SIGARCH Computer Architecture News"},{"issue":"2","key":"2026032712174878700_ref004","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/3199524.3199564","article-title":"Straggler mitigation by delayed relaunch of tasks","volume":"45","author":"Aktas","year":"2018","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"2026032712174878700_ref005","first-page":"1707","article-title":"QSGD:Communication-efficient SGD via gradient quantization and encoding","author":"Alistarh","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref006","first-page":"1","volume-title":"PLAPACK: Parallel linear algebra package design overview","author":"Alpatov","year":"1997"},{"key":"2026032712174878700_ref007","unstructured":"\u201cAmazon Elastic Compute Cloud (EC2)\u201d\n           (n.d.). https:\/\/aws.amazon.com\/ec2\/. Accessed on Jan. 30, 2018."},{"key":"2026032712174878700_ref008","first-page":"185","volume-title":"Effective straggler mitigation: Attack of the clones","author":"Ananthanarayanan","year":"2013"},{"issue":"1","key":"2026032712174878700_ref009","first-page":"24","article-title":"Reining in the outliers in map-reduce clusters using Mantri","volume":"10","author":"Ananthanarayanan","year":"2010","journal-title":"OSDI"},{"key":"2026032712174878700_ref010","unstructured":"\u201cApache Hadoop\u201d\n           (n.d.). http:\/\/hadoop.apache.org. Accessed on Jan. 30, 2018."},{"issue":"3\u20134","key":"2026032712174878700_ref011","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1561\/0100000094","article-title":"Fundamentals of index coding","volume":"14","author":"Arbabjolfaei","year":"2018","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"key":"2026032712174878700_ref012","first-page":"1","volume-title":"Information theoretic limits of data shuffling for distributed learning","author":"Attia","year":"2016"},{"key":"2026032712174878700_ref013","first-page":"549","volume-title":"Achieving efficient polynomial multiplication in fermat fields using the fast fourier transform","author":"Baktir","year":"2006"},{"key":"2026032712174878700_ref014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492914000038","article-title":"Communication lower bounds and optimal algorithms for numerical linear algebra","volume":"23","author":"Ballard","year":"2014","journal-title":"Acta Numerica"},{"issue":"3","key":"2026032712174878700_ref015","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIT.2010.2103753","article-title":"Index coding with side information","volume":"57","author":"Bar-Yossef","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref016","first-page":"1","volume-title":"Communication complexity of group key distribution","author":"Becker","year":"1998"},{"key":"2026032712174878700_ref017","first-page":"213","volume-title":"Perfectly-secure MPC with linear communication complexity","author":"Beerliova-Trubiniova","year":"2008"},{"key":"2026032712174878700_ref018","first-page":"1","volume-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"Ben-Or","year":"1988"},{"key":"2026032712174878700_ref019","first-page":"560","volume-title":"signSGD: Compressed optimisation for non-convex problems","author":"Bernstein","year":"2018"},{"issue":"6","key":"2026032712174878700_ref020","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1109\/TIT.2006.874540","article-title":"Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients","volume":"52","author":"Birk","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref021","doi-asserted-by":"crossref","DOI":"10.1109\/TCOMM.2020.2988506","article-title":"Minimizing latency for secure coded computing using secret sharing via staircase codes","author":"Bitar","year":"2020","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712174878700_ref022","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719642","volume-title":"ScaLAPACK Users\u2019 Guide","author":"Blackford","year":"1997"},{"key":"2026032712174878700_ref023","article-title":"Byzantine-tolerant machine learning","author":"Blanchard","year":"2017","journal-title":"preprint arXiv:1703.02757"},{"key":"2026032712174878700_ref024","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"Blanchard","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026032712174878700_ref025","first-page":"192","volume-title":"Sharemind: A framework for fast privacy-preserving computations","author":"BogdanovLaur","year":"2008"},{"key":"2026032712174878700_ref026","volume-title":"Practical secure aggregation for federated learning on user-held data","author":"Bonawitz","year":"2016"},{"key":"2026032712174878700_ref027","first-page":"1175","volume-title":"Practical secure aggregation for privacy-preserving machine learning","author":"Bonawitz","year":"2017"},{"key":"2026032712174878700_ref028","first-page":"13","volume-title":"Fog computing and its role in the internet of things","author":"Bonomi","year":"2012"},{"key":"2026032712174878700_ref029","article-title":"Approximate gradient coding via sparse random graphs","author":"Charles","year":"2017","journal-title":"preprint arXiv:1711.06771"},{"key":"2026032712174878700_ref030","first-page":"464","volume-title":"Replicated data placement for uncertain scheduling","author":"Chaubey","year":"2015"},{"key":"2026032712174878700_ref031","article-title":"DRACO: Robust distributed training via redundant gradients","author":"Chen","year":"2018","journal-title":"e-print arXiv:1803.09877"},{"issue":"6","key":"2026032712174878700_ref032","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1109\/JIOT.2016.2584538","article-title":"Fog and IoT: An overview of research opportunities","volume":"3","author":"Chiang","year":"2016","journal-title":"IEEE Internet of Things Journal"},{"key":"2026032712174878700_ref033","first-page":"571","volume-title":"Project Adam: Building an efficient and scalable deep learning training system","author":"Chilimbi","year":"2014"},{"key":"2026032712174878700_ref034","first-page":"857","volume-title":"Scalable network-coded PBFT consensus algorithm","author":"Choi","year":"2019"},{"issue":"7","key":"2026032712174878700_ref035","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1002\/(SICI)1096-9128(199609)8:7<517::AID-CPE226>3.0.CO;2-W","article-title":"PB-BLAS: A set of parallel block basic linear algebra subprograms","volume":"8","author":"Choi","year":"1996","journal-title":"Concurrency: Practice and Experience"},{"issue":"4","key":"2026032712174878700_ref036","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/2043164.2018448","article-title":"Managing data transfers in computer clusters with orchestra","volume":"41","author":"Chowdhury","year":"2011","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032712174878700_ref037","first-page":"280","volume-title":"Multiparty computation from threshold homomorphic encryption","author":"CramerDamg\u00e5rd","year":"2001"},{"key":"2026032712174878700_ref038","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"Cramer","year":"2015"},{"issue":"9","key":"2026032712174878700_ref039","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1016\/j.advwatres.2011.04.013","article-title":"Parallel distributed computing using python","volume":"34","author":"Dalcin","year":"2011","journal-title":"Advances in Water Resources"},{"key":"2026032712174878700_ref040","first-page":"572","volume-title":"Scalable and unconditionally secure multiparty computation","author":"Damg\u00e5rd","year":"2007"},{"issue":"2","key":"2026032712174878700_ref041","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/2408776.2408794","article-title":"The tail at scale","volume":"56","author":"Dean","year":"2013","journal-title":"Communications of the ACM"},{"key":"2026032712174878700_ref042","volume-title":"MapReduce: Simplified data processing on large clusters","author":"Dean","year":"2004"},{"issue":"1","key":"2026032712174878700_ref043","doi-asserted-by":"crossref","first-page":"A206","DOI":"10.1137\/080731992","article-title":"Communication-optimal parallel and sequential QR and LU factorizations","volume":"34","author":"Demmel","year":"2012","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2026032712174878700_ref044","first-page":"107","volume-title":"Unequal growth codes: Intermediate performance and unequal error protection for video streaming","author":"Dimakis","year":"2007"},{"key":"2026032712174878700_ref045","author":"\u201cDistributed Algorithms and Optimization Lecture Notes\u201d"},{"key":"2026032712174878700_ref046","article-title":"CodeNet: Training large scale neural networks in presence of soft-errors","author":"Dutta","year":"2019","journal-title":"preprint arXiv:1903.01042"},{"key":"2026032712174878700_ref047","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"Dutta","year":"2016","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref048","first-page":"2403","volume-title":"Coded convolution for parallel and distributed computing within a deadline","author":"Dutta","year":"2017"},{"key":"2026032712174878700_ref049","first-page":"810","volume-title":"Twister: A runtime for iterative MapReduce","author":"Ekanayake","year":"2010"},{"key":"2026032712174878700_ref050","first-page":"279","volume-title":"Communication vs. distributed computation: An alternative trade-off curve","author":"Ezzeldin","year":"2017"},{"key":"2026032712174878700_ref051","first-page":"3017","volume-title":"Numerically stable polynomially coded computing","author":"Fahim","year":"2019"},{"key":"2026032712174878700_ref052","first-page":"1264","volume-title":"On the optimal recovery threshold of coded matrix multiplication","author":"Fahim","year":"2017"},{"key":"2026032712174878700_ref053","author":"Al-Fares","year":"2010","journal-title":"Hedera: Dynamic flow scheduling for data center networks"},{"key":"2026032712174878700_ref054","first-page":"1620","volume-title":"Hierarchical coded computation","author":"Ferdinand","year":"2018"},{"issue":"1","key":"2026032712174878700_ref055","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/2796314.2745873","article-title":"Reducing latency via redundant requests: Exact analysis","volume":"43","author":"Gardner","year":"2015","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"2026032712174878700_ref056","first-page":"69","volume-title":"Large-scale matrix factorization with distributed stochastic gradient descent","author":"Gemulla","year":"2011"},{"issue":"4","key":"2026032712174878700_ref057","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1594977.1592576","article-title":"VL2: A scalable and flexible data center network","volume":"39","author":"Greenberg","year":"2009","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032712174878700_ref058","first-page":"107","volume-title":"iShuffle: Improving Hadoop performance with shuffle-on-write","author":"Guo","year":"2013"},{"key":"2026032712174878700_ref059","first-page":"298","author":"Gupta","year":"2018","journal-title":"OverSketch: Approximate matrix multiplication for the cloud"},{"key":"2026032712174878700_ref060","first-page":"545","article-title":"Result analysis of the NIPS 2003 feature selection challenge","author":"Guyon","year":"2005","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref061","first-page":"1625","volume-title":"Codes for distributed finite alphabet matrix-vector multiplication","author":"Haddadpour","year":"2018"},{"key":"2026032712174878700_ref062","author":"\u201cHadoop TeraSort\u201d"},{"key":"2026032712174878700_ref063","article-title":"Improving distributed gradient descent using Reed\u2013Solomon codes","author":"HalbawiAzizan-Ruhi","year":"2017","journal-title":"e-print arXiv:1706.05436"},{"key":"2026032712174878700_ref064","first-page":"623","volume-title":"Rational secret sharing and multiparty computation","author":"Halpern","year":"2004"},{"key":"2026032712174878700_ref065","first-page":"770","volume-title":"Deep residual learning for image recognition","author":"He","year":"2016"},{"key":"2026032712174878700_ref066","first-page":"442","volume-title":"The benefits of coding over routing in a randomized setting","author":"Ho","year":"2003"},{"issue":"6","key":"2026032712174878700_ref067","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TC.1984.1676475","article-title":"Algorithm-based fault tolerance for matrix operations","volume":"33","author":"Huang","year":"1984","journal-title":"IEEE Transactions on Computers"},{"key":"2026032712174878700_ref068","first-page":"43","volume-title":"Adversarial machine learning","author":"Huang","year":"2011"},{"key":"2026032712174878700_ref069","volume-title":"PhD thesis","author":"Huang","year":"2017"},{"key":"2026032712174878700_ref070","first-page":"2489","volume-title":"CodedSketch: Coded distributed computation of approximated matrix multiplication","author":"Jahani-Nezhad","year":"2019"},{"key":"2026032712174878700_ref071","first-page":"887","volume-title":"Masterless coded computing: A fully-distributed coded FFT algorithm","author":"JeongLow","year":"2018"},{"issue":"2","key":"2026032712174878700_ref072","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1109\/TIT.2015.2504556","article-title":"Fundamental limits of caching in wireless D2D networks","volume":"62","author":"JiCaire","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174878700_ref073","first-page":"12","article-title":"Efficient redundancy techniques for latency reduction in cloud systems","volume":"2","author":"Joshi","year":"2017","journal-title":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)"},{"issue":"5","key":"2026032712174878700_ref074","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1109\/PROC.1986.13535","article-title":"Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures","volume":"74","author":"Jou","year":"1986","journal-title":"Proceedings of the IEEE"},{"key":"2026032712174878700_ref075","article-title":"SeF: A secure fountain architecture for slashing storage costs in blockchains","author":"Kadhe","year":"2019","journal-title":"preprint arXiv:1906.12140"},{"key":"2026032712174878700_ref076","article-title":"Advances and open problems in federated learning","author":"Kairouz","year":"2019","journal-title":"preprint arXiv:1912.04977"},{"issue":"4","key":"2026032712174878700_ref077","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/1151659.1159943","article-title":"Growth codes: Maximizing sensor network data persistence","volume":"36","author":"Kamra","year":"2006","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"2026032712174878700_ref078","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"Karakus","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref079","first-page":"2142","volume-title":"Hierarchical coded caching","author":"Karamchandani","year":"2014"},{"issue":"6","key":"2026032712174878700_ref080","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1137\/08073408X","article-title":"Fast polynomial factorization and modular composition","volume":"40","author":"Kedlaya","year":"2011","journal-title":"SIAM Journal on Computing"},{"key":"2026032712174878700_ref081","article-title":"On heterogeneous coded distributed computing","author":"KiamariWang","year":"2017","journal-title":"IEEE GLOBECOM"},{"key":"2026032712174878700_ref082","first-page":"1682","volume-title":"Improved intermediate performance of rateless codes","author":"Kim","year":"2009"},{"issue":"5","key":"2026032712174878700_ref083","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TNET.2003.818197","article-title":"An algebraic approach to network coding","volume":"11","author":"Koetter","year":"2003","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"2026032712174878700_ref084","article-title":"Leveraging coding techniques for speeding up distributed computing","author":"Konstantinidis","year":"2018","journal-title":"eprint arXiv:1802.03049"},{"issue":"2","key":"2026032712174878700_ref085","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TIT.1979.1056022","article-title":"How to encode the modulo-two sum of binary sources","volume":"25","author":"Korner","year":"1979","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref086","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"Kosaian","year":"2018","journal-title":"preprint arXiv:1806.01259"},{"key":"2026032712174878700_ref087","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009","journal-title":"Tech. rep. Citeseer"},{"key":"2026032712174878700_ref088","volume-title":"Communication Complexity","author":"Kushilevitz","year":"2006"},{"issue":"3","key":"2026032712174878700_ref089","doi-asserted-by":"crossref","first-page":"1514","DOI":"10.1109\/TIT.2017.2736066","article-title":"Speeding up distributed machine learning using codes","volume":"64","author":"Lee","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref090","first-page":"2418","volume-title":"High-dimensional coded matrix multiplication","author":"Lee","year":"2017"},{"key":"2026032712174878700_ref091","first-page":"99","volume-title":"On scheduling redundant requests with cancellation overheads","author":"Lee","year":"2015"},{"key":"2026032712174878700_ref092","first-page":"2032","volume-title":"Compressed coded distributed computing","author":"Li","year":"2018"},{"issue":"1","key":"2026032712174878700_ref093","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TIT.2017.2756959","article-title":"A fundamental tradeoff between computation and communication in distributed computing","volume":"64","author":"Li","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref094","article-title":"Near-optimal straggler mitigation for distributed gradient methods","author":"Li","year":"2018","journal-title":"IPDPSW"},{"key":"2026032712174878700_ref095","article-title":"Polynomially coded regression: Optimal straggler mitigation via data encoding","author":"Li","year":"2018","journal-title":"e-print arXiv:1805.09934"},{"key":"2026032712174878700_ref096","article-title":"A unified coding framework for distributed computing with straggling servers","author":"Li","year":"2016","journal-title":"IEEE NetCod"},{"key":"2026032712174878700_ref097","doi-asserted-by":"crossref","DOI":"10.1109\/ALLERTON.2015.7447112","volume-title":"Coded MapReduce","author":"Li","year":"2015"},{"key":"2026032712174878700_ref098","volume-title":"Coded distributed computing: Straggling servers and multistage dataflows","author":"Li","year":"2016"},{"key":"2026032712174878700_ref099","article-title":"PolyShard: Coded sharding achieves linearly scaling efficiency and security simultaneously","author":"Li","year":"2018","journal-title":"arXiv: 1809.10361 [cs.CR]"},{"issue":"3","key":"2026032712174878700_ref100","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.ipl.2008.09.028","article-title":"The mailman algorithm: A note on matrix\u2013vector multiplication","volume":"109","author":"Liberty","year":"2009","journal-title":"Information Processing Letters"},{"key":"2026032712174878700_ref101","volume-title":"Error Control Coding","author":"Lin","year":"2004"},{"key":"2026032712174878700_ref102","first-page":"1005","volume-title":"In:","author":"Lindell","year":"2005"},{"issue":"8","key":"2026032712174878700_ref103","doi-asserted-by":"crossref","first-page":"716","DOI":"10.14778\/2212351.2212354","article-title":"Distributed GraphLab: A framework for machine learning and data mining in the cloud","volume":"5","author":"Low","year":"2012","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2026032712174878700_ref104","article-title":"Decentralized coded caching attains order-optimal memory-rate tradeoff","author":"Maddah-Ali","year":"2014","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"5","key":"2026032712174878700_ref105","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1109\/TIT.2014.2306938","article-title":"Fundamental limits of caching","volume":"60","author":"Maddah-Ali","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref106","volume-title":"Robust gradient descent via moment encoding with LDPC codes","author":"Maity","year":"2018"},{"issue":"9","key":"2026032712174878700_ref107","doi-asserted-by":"crossref","first-page":"5402","DOI":"10.1109\/TIT.2014.2338865","article-title":"Index coding\u2014An interference alignment perspective","volume":"60","author":"Maleki","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref108","first-page":"135","volume-title":"Pregel: A system for large-scale graph processing","author":"Malewicz","year":"2010"},{"key":"2026032712174878700_ref109","first-page":"1","volume-title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication","author":"Mallick","year":"2019"},{"issue":"9","key":"2026032712174878700_ref110","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","article-title":"On sharing secrets and Reed\u2013Solomon codes","volume":"24","author":"McEliece","year":"1981","journal-title":"Communications of the ACM"},{"key":"2026032712174878700_ref111","first-page":"1273","volume-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017"},{"key":"2026032712174878700_ref112","article-title":"Exploiting unintended feature leakage in collaborative learning","author":"Melis","year":"2019","journal-title":"arXiv:1805.04049"},{"key":"2026032712174878700_ref113","first-page":"1734","volume-title":"Patterned erasure correcting codes for low storage-overhead blockchain systems\u201d. In:","author":"Mitra","year":"2019"},{"key":"2026032712174878700_ref114","first-page":"19","volume-title":"SecureML: A system for scalable privacy-preserving machine learning","author":"Mohassel","year":"2017"},{"key":"2026032712174878700_ref115","doi-asserted-by":"crossref","DOI":"10.1145\/3295500.3356170","volume-title":"Slack squeeze coded computing for adaptive straggler mitigation","author":"Narra","year":"2019"},{"issue":"10","key":"2026032712174878700_ref116","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1109\/TIT.2007.904785","article-title":"Computation over multipleaccess channels","volume":"53","author":"Nazer","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref117","first-page":"1231","volume-title":"Limited-sharing multi-party computation for massive matrix operations","author":"Nodehi","year":"2018"},{"key":"2026032712174878700_ref118","article-title":"TeraByte sort on apache hadoop","author":"OMalley","year":"2008","journal-title":"Tech. rep. Yahoo"},{"key":"2026032712174878700_ref119","unstructured":"\u201cOpen MPI: Open source high performance computing\u201d\n           (n.d.). https:\/\/www.open-mpi.org\/."},{"issue":"1","key":"2026032712174878700_ref120","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/18.50368","article-title":"Average and randomized communication complexity","volume":"36","author":"Orlitsky","year":"1990","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712174878700_ref121","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/18.915643","article-title":"Coding for computing","volume":"47","author":"Orlitsky","year":"2001","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712174878700_ref122","doi-asserted-by":"crossref","first-page":"6734","DOI":"10.1109\/TIT.2011.2162191","article-title":"Securing dynamic distributed storage systems against eavesdropping and adversarial attacks","volume":"57","author":"Pawar","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712174878700_ref123","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2427023.2427030","article-title":"Elemental: A new framework for distributed memory dense matrix computations","volume":"39","author":"Poulson","year":"2013","journal-title":"ACM Transactions on Mathematical Software"},{"key":"2026032712174878700_ref124","article-title":"Coded computing for distributed graph analytics","author":"Prakash","year":"2018","journal-title":"IEEE ISIT"},{"key":"2026032712174878700_ref125","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"Rajaraman","year":"2011"},{"issue":"4","key":"2026032712174878700_ref126","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/JSAC.2013.130404","article-title":"Communicating the sum of sources over a network","volume":"31","author":"Ramamoorthy","year":"2013","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032712174878700_ref127","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"Raviv","year":"2017","journal-title":"e-print arXiv:1707.03858"},{"issue":"1","key":"2026032712174878700_ref128","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","article-title":"Optimal locally repairable and secure codes for distributed storage systems","volume":"60","author":"Rawat","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref129","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"Recht","year":"2011","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"issue":"7","key":"2026032712174878700_ref130","doi-asserted-by":"crossref","first-page":"4227","DOI":"10.1109\/TIT.2019.2904055","article-title":"Coded computation over heterogeneous clusters","volume":"65","author":"Reisizadeh","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref131","first-page":"2408","article-title":"Coded computation over heterogeneous clusters","author":"Reisizadeh","year":"2017","journal-title":"IEEE ISIT"},{"key":"2026032712174878700_ref132","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107324893","volume-title":"Manifolds, Tensors, and Forms: An Introduction for Mathematicians and Physicists","author":"Renteln","year":"2013"},{"key":"2026032712174878700_ref133","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"Roth","year":"2006"},{"key":"2026032712174878700_ref134","first-page":"1112","volume-title":"INTERPOL: Information theoretically verifiable polynomial evaluation","author":"Sahraei","year":"2019"},{"key":"2026032712174878700_ref135","article-title":"Interactive verifiable polynomial evaluation","author":"Sahraei","year":"2019","journal-title":"preprint arXiv:1907.04302"},{"key":"2026032712174878700_ref136","first-page":"478","volume-title":"Intermediate performance of rateless codes","author":"Sanghavi","year":"2007"},{"key":"2026032712174878700_ref137","first-page":"416","volume-title":"A generalized representer theorem","author":"Sch\u00f6lkopf","year":"2001"},{"key":"2026032712174878700_ref138","doi-asserted-by":"crossref","DOI":"10.21437\/Interspeech.2014-274","volume-title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns","author":"Seide","year":"2014"},{"issue":"2","key":"2026032712174878700_ref139","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1109\/TCOMM.2015.2506161","article-title":"When do redundant requests reduce latency?","volume":"64","author":"Shah","year":"2016","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712174878700_ref140","first-page":"1","volume-title":"Information-theoretically secure regenerating codes for distributed storage","author":"Shah","year":"2011"},{"issue":"11","key":"2026032712174878700_ref141","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Communications of the ACM"},{"key":"2026032712174878700_ref142","first-page":"1152","volume-title":"Local graph coloring and index coding","author":"Shanmugam","year":"2013"},{"issue":"2","key":"2026032712174878700_ref143","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","article-title":"Maximum distance q-nary codes","volume":"10","author":"Singleton","year":"1964","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712174878700_ref144","article-title":"Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning","author":"So","year":"2020","journal-title":"arXiv: 2002.04156 [cs.LG]"},{"key":"2026032712174878700_ref145","article-title":"CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning","author":"So","year":"2019","journal-title":"CoRR. abs\/1902.00641. arXiv: 1902.00641"},{"key":"2026032712174878700_ref146","article-title":"A pliable index coding approach to data shuffling","author":"Song","year":"2017","journal-title":"e-print arXiv:1701.05540"},{"key":"2026032712174878700_ref147","first-page":"3368","volume-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"Tandon","year":"2017"},{"issue":"1","key":"2026032712174878700_ref148","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/LCOMM.2018.2880213","article-title":"Erasure Coding for distributed matrix multiplication for matrices with bounded entries","volume":"23","author":"Tang","year":"2019","journal-title":"IEEE Communications Letters"},{"key":"2026032712174878700_ref149","unstructured":"\u201ctc \u2013 show\/manipulate traffic control settings\u201d\n           (n.d.). http:\/\/lartc.org\/manpages\/tc.txt."},{"key":"2026032712174878700_ref150","first-page":"1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Ullman","year":"1974"},{"issue":"4","key":"2026032712174878700_ref151","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","article-title":"SUMMA: Scalable universal matrix multiplication algorithm","volume":"9","author":"Van De Geijn","year":"1997","journal-title":"Concurrency-Practice and Experience"},{"key":"2026032712174878700_ref152","article-title":"Fundamental limits of distributed data shuffling","author":"Wan","year":"2018","journal-title":"e-print arXiv:1807.00056"},{"issue":"1","key":"2026032712174878700_ref153","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1145\/2637364.2592042","article-title":"Efficient task replication for fast response times in parallel computation","volume":"42","author":"Wang","year":"2014","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"2026032712174878700_ref154","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"Wang","year":"2019","journal-title":"preprint arXiv:1901.09671"},{"key":"2026032712174878700_ref155","article-title":"Coded sparse matrix multiplication","author":"Wang","year":"2018","journal-title":"e-print arXiv:1802.03430"},{"issue":"3","key":"2026032712174878700_ref156","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/3366700","article-title":"Fundamental limits of approximate gradient coding","volume":"3","author":"Wang","year":"2019","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"2026032712174878700_ref157","article-title":"Fundamental limits of coded linear transform","author":"Wang","year":"2018","journal-title":"e-print arXiv:1804.09791"},{"key":"2026032712174878700_ref158","first-page":"1508","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","author":"Wen","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref159","article-title":"A new combinatorial design of coded distributed computing","author":"Woolsey","year":"2018","journal-title":"e-print arXiv:1802.03870"},{"issue":"1","key":"2026032712174878700_ref160","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TIFS.2018.2846601","article-title":"Secure distributed computing with straggling servers using polynomial codes","volume":"14","author":"Yang","year":"2019","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2026032712174878700_ref161","first-page":"2654","volume-title":"Coded elastic computing","author":"Yang","year":"2019"},{"key":"2026032712174878700_ref162","first-page":"709","volume-title":"Advances in Neural Information Processing Systems 30","author":"Yang","year":"2017"},{"key":"2026032712174878700_ref163","first-page":"209","volume-title":"Some complexity questions related to distributive computing (preliminary report)","author":"Yao","year":"1979"},{"key":"2026032712174878700_ref164","article-title":"Communication-computation efficient gradient coding","author":"Ye","year":"2018","journal-title":"e-print arXiv:1802.03475"},{"key":"2026032712174878700_ref165","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-51280-4_8","article-title":"Coded Merkle tree: Solving data availability attacks in blockchains","author":"Yu","year":"2020","journal-title":"Financial Cryptography and Data Security (FC)"},{"key":"2026032712174878700_ref166","first-page":"1","volume-title":"How to optimally allocate resources for coded distributed computing?","author":"Yu","year":"2017"},{"key":"2026032712174878700_ref167","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"Yu","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"2026032712174878700_ref168","article-title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding","author":"Yu","year":"2018","journal-title":"e-print arXiv:1801.07487"},{"key":"2026032712174878700_ref169","first-page":"2022","volume-title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding","author":"Yu","year":"2018"},{"key":"2026032712174878700_ref170","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"Yu","year":"2018","journal-title":"e-print arXiv:1806.00939"},{"key":"2026032712174878700_ref171","first-page":"10","article-title":"Spark: Cluster computing with working sets","volume":"10","author":"Zaharia","year":"2010","journal-title":"In:"},{"issue":"4","key":"2026032712174878700_ref172","first-page":"7","article-title":"Improving MapReduce performance in heterogeneous environments","volume":"8","author":"Zaharia","year":"2008","journal-title":"Operating Systems Design and Implementation"},{"key":"2026032712174878700_ref173","first-page":"472","volume-title":"Accelerating MapReduce with distributed memory cache","author":"Zhang","year":"2009"},{"key":"2026032712174878700_ref174","first-page":"839","volume-title":"Performance modeling of MapReduce jobs in heterogeneous cloud environments","author":"Zhang","year":"2013"},{"key":"2026032712174878700_ref175","first-page":"249","volume-title":"A fast parallel SGD for matrix factorization in shared memory systems","author":"Zhuang","year":"2013"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/17\/1\/1\/11158637\/0100000103en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/17\/1\/1\/11158637\/0100000103en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:46Z","timestamp":1777471846000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/17\/1\/1\/1332643\/Coded-Computing-Mitigating-Fundamental-Bottlenecks"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":175,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,8,20]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000103","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,20]]}}}