{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:37:40Z","timestamp":1790750260409,"version":"4.1.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1817154"],"award-info":[{"award-number":["CCF-1817154"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["SpecEES-1824558"],"award-info":[{"award-number":["SpecEES-1824558"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011660","name":"Idaho National Laboratory (INL) Laboratory Directed Research and Development (LDRD) Program under DOE Idaho Operations Office","doi-asserted-by":"publisher","award":["DE-AC07-05ID14517"],"award-info":[{"award-number":["DE-AC07-05ID14517"]}],"id":[{"id":"10.13039\/100011660","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tcomm.2021.3056089","type":"journal-article","created":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T05:13:41Z","timestamp":1612242821000},"page":"2894-2908","source":"Crossref","is-referenced-by-count":15,"title":["Coded Elastic Computing on Machines With Heterogeneous Storage and Computation Speed"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6354-1419","authenticated-orcid":false,"given":"Nicholas","family":"Woolsey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong-Rong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7970-2245","authenticated-orcid":false,"given":"Mingyue","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Coded elastic computing","author":"yang","year":"2018","journal-title":"arXiv 1812 06411"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013430"},{"key":"ref31","article-title":"Optimizing the transition waste in coded elastic computing","author":"dau","year":"2019","journal-title":"arXiv 1910 00796"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849212"},{"key":"ref10","article-title":"Coded distributed computing with heterogeneous function assignments","author":"woolsey","year":"2019","journal-title":"arXiv 1902 10738"},{"key":"ref11","article-title":"Topological coded distributed computing","author":"wan","year":"2020","journal-title":"arXiv 2004 04421"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2926704"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437672"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2966197"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref16","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","article-title":"Distributed linearly separable computation","author":"wan","year":"2020","journal-title":"arXiv 2007 00345"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref28","first-page":"902","article-title":"Draco: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647133"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174230"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437882"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437653"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3128601"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437323"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849845"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437860"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013319"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174275"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref22","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","article-title":"Cache-aided matrix multiplication retrieval","author":"wan","year":"2020","journal-title":"arXiv 2007 00856"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007060"},{"key":"ref26","article-title":"Private function computation for noncolluding coded databases","author":"obead","year":"2020","journal-title":"arXiv 2003 10007"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2888494"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/9433469\/9343877-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9433469\/09343877.pdf?arnumber=9343877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:51Z","timestamp":1652194131000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9343877\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2021.3056089","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}