{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T19:48:49Z","timestamp":1793476129197,"version":"4.5.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003662","name":"Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003662","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tcomm.2020.3030667","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:32:26Z","timestamp":1602617546000},"page":"44-58","source":"Crossref","is-referenced-by-count":30,"title":["Optimal Load Allocation for Coded Distributed Computation in Heterogeneous Clusters"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5452-7906","authenticated-orcid":false,"given":"Daejin","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3686-8891","authenticated-orcid":false,"given":"Hyegyeong","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0151-1297","authenticated-orcid":false,"given":"Jun Kyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2987550.2987554"},{"key":"ref38","year":"2020"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref32","first-page":"7","article-title":"Improving MapReduce performance in heterogeneous environments","volume":"8","author":"zaharia","year":"2008","journal-title":"Proc of the 2nd USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref30","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"kosaian","year":"2018","journal-title":"arXiv 1806 01259"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9620-8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(94)90172-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2018.00013"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref40","author":"mackay","year":"2002","journal-title":"Information Theory Inference & Learning Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277996"},{"key":"ref13","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proc Adv Neural Inform Process Syst (NIPS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref15","first-page":"1","article-title":"Anytime MiniBatch: Exploiting stragglers in online distributed optimization","author":"ferdinand","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262879"},{"key":"ref17","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref18","first-page":"4305","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref19","article-title":"Improving distributed gradient descent using Reed–Solomon codes","author":"halbawi","year":"2017","journal-title":"arXiv 1706 05436"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref3","first-page":"95","article-title":"Spark: Cluster computing with working sets","volume":"10","author":"zaharia","year":"2010","journal-title":"USENIX Workshop on Hot Topics in Cloud Computing"},{"key":"ref6","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inform Process Syst (NIPS)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2940671"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849236"},{"key":"ref1","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Adv Neural Inform Process Syst (NIPS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2930513"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2911496"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/0-8176-4487-3_11"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2909034"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9325108\/09222032.pdf?arnumber=9222032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:52Z","timestamp":1652194132000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9222032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":41,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3030667","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}