{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T02:44:57Z","timestamp":1790217897774,"version":"4.1.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tpds.2023.3240833","type":"journal-article","created":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T18:41:45Z","timestamp":1675190505000},"page":"1215-1226","source":"Crossref","is-referenced-by-count":19,"title":["Scheduling Algorithms for Federated Learning With Minimal Energy Consumption"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0997-586X","authenticated-orcid":false,"given":"La\u00e9rcio Lima","family":"Pilla","sequence":"first","affiliation":[{"name":"University of Bordeaux, CNRS, Bordeaux INP, Inria, LaBRI, UMR 5800, Talence, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","author":"McMahan"},{"key":"ref2","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Conf. Mach. Learn. Syst.","author":"Bonawitz"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2986024"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3424660"},{"key":"ref5","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref6","first-page":"18839","article-title":"Federated graph classification over non-IID graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Xie"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11723-8_9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SBAC-PADW53941.2021.00016"},{"key":"ref9","first-page":"24617","article-title":"Federated split task-agnostic vision transformer for covid-19 CXR diagnosis","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Park"},{"key":"ref10","article-title":"AI and compute","author":"Amodei","year":"2018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3381831"},{"issue":"248","key":"ref12","first-page":"1","article-title":"Towards the systematic reporting of the energy and carbon footprints of machine learning","volume":"21","author":"Henderson","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref13","article-title":"A first look into the carbon footprint of federated learning","author":"Qiu","year":"2021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480129"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3321408.3323080"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS46320.2019.00043"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737464"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3022534"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2019.2917133"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/VTS-APWCS.2019.8851649"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488839"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3055523"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3037554"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3464419"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00031"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3023905"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00074"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2827055"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3027338"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3040887"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900649"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488679"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2820975.2820980"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545073"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2016.2562920"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425685"},{"key":"ref37","article-title":"Flower: A friendly federated learning framework","author":"Beutel","year":"2022"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3556557.3557950"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.07.007"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1201\/9781584889465","volume-title":"Parallel Algorithms","author":"Casanova","year":"2008"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7_11"},{"issue":"2","key":"ref42","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","article-title":"An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem","volume":"262","author":"Furini","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105693"},{"issue":"1","key":"ref44","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","article-title":"Exact methods for the knapsack problem and its generalizations","volume":"28","author":"Dudzi\u0144ski","year":"1987","journal-title":"Eur. J. Oper. Res."},{"key":"ref45","article-title":"LLPilla\/energy-optimal-federated-learning: Full set of algorithms: (MC)2MKP, MarIn, MarCo, MarDec, and MarDecUn","author":"Pilla","year":"2022"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/10043602\/10032558.pdf?arnumber=10032558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T17:45:42Z","timestamp":1717436742000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10032558\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2023.3240833","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}