{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:58:25Z","timestamp":1768417105214,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"15","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2022-04754"],"award-info":[{"award-number":["RGPIN-2022-04754"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Internet Things J."],"published-print":{"date-parts":[[2024,8,1]]},"DOI":"10.1109\/jiot.2024.3394714","type":"journal-article","created":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T17:42:11Z","timestamp":1715017331000},"page":"26076-26090","source":"Crossref","is-referenced-by-count":2,"title":["DAS: A DRL-Based Scheme for Workload Allocation and Worker Selection in Distributed Coded Machine Learning"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8081-1705","authenticated-orcid":false,"given":"Yitong","family":"Zhou","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6311-5970","authenticated-orcid":false,"given":"Qiang","family":"Ye","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Huang","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, Dalhousie University, Halifax, NS, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11023-020-09548-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3015777"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106775"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01664-x"},{"key":"ref6","first-page":"265","article-title":"Reining in the outliers in map-reduce clusters using Mantri","volume-title":"Proc. 9th USENIX Symp. Oper. Syst. Design Implement. (OSDI)","author":"Ananthanarayanan"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2017.1700271"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/e24091284"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10278586"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3390\/s18103453"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449888"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488672"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3128887"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3316470"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref17","first-page":"1","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Yu"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref19","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref21","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"Kosaian","year":"2018","journal-title":"arXiv:1806.01259"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500346"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3187427"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IOTM.001.2300247"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3078494"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.08.043"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2971871"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107144"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2509413.2509416"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2020.105895"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2022.3144771"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2019.8891198"},{"key":"ref35","article-title":"Continuous control with deep reinforcement learning","author":"Lillicrap","year":"2015","journal-title":"arXiv:1509.02971"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/s21051666"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3188921"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3115054"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.5220\/0007724500590066"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1561\/2200000071"},{"key":"ref41","first-page":"331","article-title":"Markov decision processes","volume-title":"Handbooks in Operations Research and Management Science","volume":"2","author":"Puterman","year":"1990"},{"key":"ref42","first-page":"16509","article-title":"Multi-agent reinforcement learning is a sequence modeling problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Wen"},{"key":"ref43","article-title":"On the properties of the softmax function with application in game theory and reinforcement learning","author":"Gao","year":"2017","journal-title":"arXiv:1704.00805"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"key":"ref45","volume-title":"GRFPU-high performance IEEE-754 floating-point unit","author":"Catovic","year":"2004"}],"container-title":["IEEE Internet of Things Journal"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488907\/10607832\/10521541.pdf?arnumber=10521541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T18:42:09Z","timestamp":1721846529000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10521541\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":45,"journal-issue":{"issue":"15"},"URL":"https:\/\/doi.org\/10.1109\/jiot.2024.3394714","relation":{},"ISSN":["2327-4662","2372-2541"],"issn-type":[{"value":"2327-4662","type":"electronic"},{"value":"2372-2541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]}}}