{"id":"https://openalex.org/W2280162366","doi":"https://doi.org/10.1109/allerton.2015.7447050","title":"Algorithms for scheduling deadline-sensitive malleable tasks","display_name":"Algorithms for scheduling deadline-sensitive malleable tasks","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2280162366","doi":"https://doi.org/10.1109/allerton.2015.7447050","mag":"2280162366"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2015.7447050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5114686018","display_name":"Xiaohu Wu","orcid":"https://orcid.org/0000-0002-2012-8517"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xiaohu Wu","raw_affiliation_strings":["Department of Networking and Security, EURECOM, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Networking and Security, EURECOM, France","institution_ids":["https://openalex.org/I1902872"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077502412","display_name":"Patrick Loiseau","orcid":"https://orcid.org/0000-0003-0674-3369"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Patrick Loiseau","raw_affiliation_strings":["Department of Networking and Security, EURECOM, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Networking and Security, EURECOM, France","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1229,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94569221,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"530","last_page":"537"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9961000084877014,"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/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.852941632270813},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.7185583114624023},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6367072463035583},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5188025832176208},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48484861850738525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4691440165042877},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.46511533856391907},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4635583162307739},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.46153128147125244},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44553613662719727},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44386759400367737},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4279693365097046},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42225590348243713},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4174099564552307},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.41356366872787476},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16083800792694092},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10828885436058044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07896414399147034}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.852941632270813},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.7185583114624023},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6367072463035583},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5188025832176208},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48484861850738525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4691440165042877},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.46511533856391907},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4635583162307739},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.46153128147125244},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44553613662719727},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44386759400367737},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4279693365097046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42225590348243713},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4174099564552307},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.41356366872787476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16083800792694092},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10828885436058044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07896414399147034},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2015.7447050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:fr.eurecom:4746","is_oa":false,"landing_page_url":"http://www.eurecom.fr/publication/4746","pdf_url":null,"source":{"id":"https://openalex.org/S4377196942","display_name":"Graduate School and Research Center in Digital Science (EURECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1902872","host_organization_name":"EURECOM","host_organization_lineage":["https://openalex.org/I1902872"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ALLERTON 2015, 53rd Annual Allerton Conference on Communication, Control, and Computing, September 30th-October 2nd, 2015, Urbana-Champaign, IL, USA","raw_type":"Conference"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W67380834","https://openalex.org/W93003659","https://openalex.org/W236893983","https://openalex.org/W1463932917","https://openalex.org/W1576380096","https://openalex.org/W1598064945","https://openalex.org/W1899379166","https://openalex.org/W1985419898","https://openalex.org/W2025222277","https://openalex.org/W2025549137","https://openalex.org/W2076472694","https://openalex.org/W2076885483","https://openalex.org/W2081954069","https://openalex.org/W2092461546","https://openalex.org/W2122985136","https://openalex.org/W2154042331","https://openalex.org/W2157954477","https://openalex.org/W2168391295","https://openalex.org/W2183243439","https://openalex.org/W2280162366","https://openalex.org/W2484338577","https://openalex.org/W2914802492","https://openalex.org/W2995564009","https://openalex.org/W3105569215","https://openalex.org/W4205585032","https://openalex.org/W4246899220","https://openalex.org/W4255182129","https://openalex.org/W4255774558","https://openalex.org/W6759352090"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2367142822","https://openalex.org/W2167574351","https://openalex.org/W2172075652","https://openalex.org/W2383668729","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2397293317"],"abstract_inverted_index":{"Due":[0],"to":[1,43,75,123],"the":[2,11,67,70],"ubiquity":[3],"of":[4,14,39,72,97,107,148],"batch":[5,17,109],"data":[6],"processing":[7],"in":[8,35],"cloud":[9],"computing,":[10],"fundamental":[12],"problem":[13],"scheduling":[15,139,156],"malleable":[16,108],"tasks":[18,41,110],"and":[19,50,62,100,119,136,146,150],"its":[20,84],"extensions":[21],"have":[22],"received":[23],"significant":[24],"attention":[25],"recently.":[26],"In":[27],"this":[28,87],"paper,":[29],"we":[30,89],"consider":[31],"an":[32,137],"important":[33],"model":[34],"which":[36],"a":[37,56,58,60,63,76,94,98,105,120,126,133],"set":[38,106],"n":[40],"is":[42,53],"be":[44,114],"scheduled":[45,115],"on":[46,116],"C":[47,117],"identical":[48],"machines":[49,73],"each":[51],"task":[52,77],"specified":[54],"by":[55],"value,":[57],"workload,":[59],"deadline":[61],"parallelism":[64,68],"bound.":[65],"Within":[66],"bound,":[69],"number":[71],"allocated":[74],"can":[78,113],"vary":[79],"over":[80],"time":[81],"without":[82],"affecting":[83],"workload.":[85],"For":[86],"model,":[88],"obtain":[90],"two":[91],"core":[92,130],"results:":[93],"quantitative":[95],"characterization":[96],"sufficient":[99],"necessary":[101],"condition":[102],"such":[103,125],"that":[104,141],"with":[111],"deadlines":[112],"machines,":[118],"polynomial-time":[121],"algorithm":[122,140],"produce":[124],"feasible":[127],"schedule.":[128],"These":[129],"results":[131],"provide":[132],"conceptual":[134],"tool":[135],"optimal":[138],"enable":[142],"proposing":[143],"new":[144],"analyses":[145],"designs":[147],"algorithms":[149,153],"improving":[151],"existing":[152],"for":[154],"extensive":[155],"objectives.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}