{"id":"https://openalex.org/W4414534336","doi":"https://doi.org/10.1109/tpds.2025.3638703","title":"Scheduling Jobs Under a Variable Number of Processors","display_name":"Scheduling Jobs Under a Variable Number of Processors","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4414534336","doi":"https://doi.org/10.1109/tpds.2025.3638703"},"language":null,"primary_location":{"id":"doi:10.1109/tpds.2025.3638703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2025.3638703","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037778045","display_name":"Anne Beno\u00eet","orcid":"https://orcid.org/0000-0003-2910-3540"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anne Benoit","raw_affiliation_strings":["ENS de Lyon, CNRS, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, Lyon cedex 07, France","ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)"],"affiliations":[{"raw_affiliation_string":"ENS de Lyon, CNRS, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, Lyon cedex 07, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119436630","display_name":"Joachim Cendrier","orcid":null},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Joachim Cendrier","raw_affiliation_strings":["CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)"],"affiliations":[{"raw_affiliation_string":"CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086100728","display_name":"Fr\u00e9d\u00e9ric Vivien","orcid":"https://orcid.org/0000-0002-0663-6152"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Vivien","raw_affiliation_strings":["CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, Lyon cedex 07, France","ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)"],"affiliations":[{"raw_affiliation_string":"CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, LIP, UMR 5668, Lyon, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS, ENS de Lyon, Inria, Université Claude Bernard Lyon 1, Lyon cedex 07, France","institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037778045"],"corresponding_institution_ids":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I4210144566"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36463395,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":"2","first_page":"427","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9659000039100647,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/goodput","display_name":"Goodput","score":0.6452000141143799},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5641999840736389},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4242999851703644},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4205000102519989},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.41200000047683716},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.390500009059906},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.3873000144958496},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.3353999853134155}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8305000066757202},{"id":"https://openalex.org/C94022561","wikidata":"https://www.wikidata.org/wiki/Q1172393","display_name":"Goodput","level":4,"score":0.6452000141143799},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5641999840736389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4733000099658966},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.454800009727478},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41200000047683716},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3095000088214874},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C206658404","wikidata":"https://www.wikidata.org/wiki/Q12725","display_name":"Electricity","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.2919999957084656},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C124343487","wikidata":"https://www.wikidata.org/wiki/Q1046373","display_name":"Critical section","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tpds.2025.3638703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2025.3638703","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322893","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2013703780","https://openalex.org/W2033168303","https://openalex.org/W2055964748","https://openalex.org/W2131053137","https://openalex.org/W2486341861","https://openalex.org/W2729256190","https://openalex.org/W2901137534","https://openalex.org/W2963114049","https://openalex.org/W3175111539","https://openalex.org/W3204728447","https://openalex.org/W4388581059","https://openalex.org/W4388966802","https://openalex.org/W4395106470","https://openalex.org/W4406713639","https://openalex.org/W7105850081"],"related_works":[],"abstract_inverted_index":{"Even":[0],"though":[1],"it":[2,217],"is":[3,41,82,98,103,279],"usually":[4],"assumed":[5],"that":[6,25,51,64,95,202,216],"data":[7,30],"centers":[8,31],"can":[9,26,53,237],"always":[10],"operate":[11],"at":[12,280,282],"maximum":[13],"capacity,":[14],"there":[15],"have":[16,219,246],"been":[17],"recent":[18],"scenarios":[19,63],"where":[20],"the":[21,36,62,67,71,77,91,107,110,116,124,130,152,168,171,188,210,214,229,234,250,253,268,273,288,291],"amount":[22],"of":[23,38,79,113,126,147,160,170,182,213,228,252,267,290],"electricity":[24],"be":[27,54,238],"used":[28],"by":[29,193],"evolve":[32],"over":[33,183],"time.":[34],"Hence,":[35],"number":[37,78,125],"available":[39],"processors":[40],"not":[42],"a":[43,57,74,177,195,206,283],"constant":[44],"anymore.":[45],"In":[46],"this":[47],"work,":[48],"we":[49,65],"assume":[50],"jobs":[52,114,146,244,269,278],"checkpointed":[55],"before":[56,73,90],"resource":[58,68],"change.":[59],"Indeed,":[60],"in":[61,76,123],"consider,":[66],"provider":[69],"warns":[70],"user":[72],"change":[75,92],"processors.":[80],"It":[81],"thus":[83],"possible":[84],"to":[85,105,154,209,247,256],"anticipate":[86],"and":[87,132,136,150],"take":[88],"checkpoints":[89],"happens,":[93],"such":[94],"no":[96],"work":[97],"ever":[99],"lost.":[100],"The":[101],"goal":[102],"then":[104],"maximize":[106],"goodput":[108],"and/or":[109],"minimum":[111,197,235],"yield":[112,198,236,274],"within":[115,270],"next":[117,254],"section":[118,255],"(time":[119],"between":[120,276],"two":[121],"changes":[122],"processors).":[127],"We":[128],"model":[129],"problem":[131],"design":[133],"greedy":[134],"solutions":[135],"sophisticated":[137],"dynamic":[138],"programming":[139],"algorithms":[140,153,175,189],"with":[141],"some":[142],"optimality":[143],"results":[144],"for":[145,265],"infinite":[148,186],"duration,":[149],"adapt":[151],"finite":[155,232],"jobs.":[156],"A":[157],"comprehensive":[158],"set":[159],"simulations,":[161],"building":[162],"on":[163],"real-life":[164],"job":[165,204,223],"sets,":[166],"demonstrates":[167],"performance":[169],"proposed":[172,292],"algorithms.":[173,293],"Most":[174],"achieve":[176],"useful":[178],"platform":[179,211],"utilization":[180],"(goodput)":[181],"95%.":[184],"With":[185],"jobs,":[187,233],"also":[190],"keep":[191],"fairness":[192,289],"having":[194],"relative":[196],"above":[199],"0.8,":[200],"meaning":[201],"each":[203,222,271],"gets":[205],"good":[207],"access":[208],"(80%":[212],"time":[215],"would":[218],"had":[220,224],"if":[221],"its":[225],"perfect":[226],"share":[227],"platform).":[230],"For":[231],"low":[239],"since":[240],"very":[241],"short":[242],"new":[243],"may":[245],"wait":[248],"until":[249],"beginning":[251],"start":[257],"(and":[258],"finish),":[259],"significantly":[260],"impacting":[261],"their":[262],"yield.":[263],"However,":[264],"75%":[266],"workload,":[272],"ratio":[275],"these":[277],"most":[281],"factor":[284],"two,":[285],"hence":[286],"demonstrating":[287]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-09-26T00:00:00"}