{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:22Z","timestamp":1773377782517,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174521","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"174-178","source":"Crossref","is-referenced-by-count":5,"title":["Optimizing the Transition Waste in Coded Elastic Computing"],"prefix":"10.1109","author":[{"given":"Hoang","family":"Dau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Chih","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang-Hung","family":"Luu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eidah","family":"Alzahrani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zahir","family":"Tari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"kosaian","year":"2018"},{"key":"ref11","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume":"89","author":"yu","year":"2019","journal-title":"Mach Learn Res"},{"key":"ref12","year":"0","journal-title":"Amazon EC2 Spot Instances"},{"key":"ref13","year":"0","journal-title":"MicrosoftAzureBatch"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849212"},{"key":"ref15","article-title":"Optimizing the transition waste in coded elastic computing","author":"dau","year":"2019"},{"key":"ref16","author":"colbourn","year":"2006","journal-title":"Handbook of Combinatorial Designs Second Edition (Discrete Mathematics and Its Applications)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref3","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref6","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Adv Neural Inform Process Syst"},{"key":"ref5","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Adv Neural Inform Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref7","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Adv Neural Inform Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","article-title":"Rateless codes for nearperfect load balancing in distributed matrix-vector multiplication","author":"mallick","year":"2018"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174521.pdf?arnumber=9174521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:08Z","timestamp":1773347708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174521\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174521","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}