{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:12Z","timestamp":1761294312036,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"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":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414863","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"page":"4045-4049","source":"Crossref","is-referenced-by-count":9,"title":["Hierarchical Coded Elastic Computing"],"prefix":"10.1109","author":[{"given":"Shahrzad","family":"Kiani","sequence":"first","affiliation":[]},{"given":"Tharindu","family":"Adikari","sequence":"additional","affiliation":[]},{"given":"Stark C.","family":"Draper","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref3","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Int Conf Neural Inf Proc Sys (NIPS)"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ISIT44484.2020.9174521"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref11","first-page":"168","article-title":"Heterogeneous computation assignments in coded elastic computing","author":"woolsey","year":"2020","journal-title":"IEEE Int Symp Inf Theory (ISIT)"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ISIT.2018.8437871"},{"year":"2020","author":"woolsey","article-title":"Coded elastic computing on machines with heterogeneous storage and computation speed","key":"ref12"},{"key":"ref8","article-title":"Cuboid partitioning for hierarchical coded matrix multiplication","author":"kiani","year":"2019","journal-title":"IEEE Int Conf on Machine Learning (Workshop on Coded Machine Learning)"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/CWIT.2019.8929896"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.2020.3036763","article-title":"Hierarchical coded matrix multiplication","volume":"67","author":"kiani","year":"2021","journal-title":"IEEE Trans Inf Theory"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ISIT.2019.8849212"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414863.pdf?arnumber=9414863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:41:10Z","timestamp":1652197270000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414863\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414863","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}