{"id":"https://openalex.org/W2487413466","doi":"https://doi.org/10.1109/infocom.2016.7524417","title":"Scheduling jobs with non-uniform demands on multiple servers without interruption","display_name":"Scheduling jobs with non-uniform demands on multiple servers without interruption","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2487413466","doi":"https://doi.org/10.1109/infocom.2016.7524417","mag":"2487413466"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["Electrical Engineering and Computer Engineering, University of California, Merced, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Engineering, University of California, Merced, CA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012118712","display_name":"Mina Naghshnejad","orcid":"https://orcid.org/0000-0001-5672-142X"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mina Naghshnejad","raw_affiliation_strings":["Electrical Engineering and Computer Engineering, University of California, Merced, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Engineering, University of California, Merced, CA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058282709","display_name":"Mukesh Singhal","orcid":"https://orcid.org/0000-0002-0497-1942"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mukesh Singhal","raw_affiliation_strings":["Electrical Engineering and Computer Engineering, University of California, Merced, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Engineering, University of California, Merced, CA","institution_ids":["https://openalex.org/I156087764"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4772,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84707899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9984999895095825,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.8309304118156433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.809945285320282},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6842426061630249},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6027653217315674},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5843527317047119},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.488427072763443},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.4787849187850952},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.45035916566848755},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43845221400260925},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4294499456882477},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4231623709201813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3915795385837555},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2876704931259155},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.20050954818725586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1847463846206665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10276064276695251}],"concepts":[{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.8309304118156433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.809945285320282},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6842426061630249},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6027653217315674},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5843527317047119},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.488427072763443},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.4787849187850952},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.45035916566848755},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43845221400260925},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4294499456882477},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4231623709201813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3915795385837555},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2876704931259155},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.20050954818725586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1847463846206665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10276064276695251}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1563776668","https://openalex.org/W1773653770","https://openalex.org/W1899379166","https://openalex.org/W1944778298","https://openalex.org/W1968395113","https://openalex.org/W1970286891","https://openalex.org/W1982860322","https://openalex.org/W1988328380","https://openalex.org/W2003902046","https://openalex.org/W2028617807","https://openalex.org/W2059422698","https://openalex.org/W2080589812","https://openalex.org/W2096825534","https://openalex.org/W2111326262","https://openalex.org/W2111556044","https://openalex.org/W2120753138","https://openalex.org/W2122967269","https://openalex.org/W2124881553","https://openalex.org/W2147598193","https://openalex.org/W2150207209","https://openalex.org/W2150498383","https://openalex.org/W2155087380","https://openalex.org/W2160756722","https://openalex.org/W2173213060","https://openalex.org/W2395177313","https://openalex.org/W4205585032","https://openalex.org/W4247529034","https://openalex.org/W4255654664"],"related_works":["https://openalex.org/W2794663421","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3115567997","https://openalex.org/W2142195909","https://openalex.org/W2963761620","https://openalex.org/W2092966558","https://openalex.org/W2917736609","https://openalex.org/W1956651153","https://openalex.org/W1984267569"],"abstract_inverted_index":{"We":[0,51,99,162],"consider":[1],"the":[2,29,36,56,102,126,137,166,195,211,225,254,271],"problem":[3,54,113,268],"of":[4,81,105,110],"scheduling":[5,138,151],"jobs":[6,24,59,132,152,174,200,220],"with":[7,55,121,153,175,221],"varying":[8],"demands":[9,133,155,202,223],"on":[10,101,156,233,266],"multiple":[11,23,157],"servers.":[12],"Each":[13],"server":[14,273],"has":[15],"a":[16,85,190],"certain":[17],"computing":[18],"capacity":[19],"and":[20,47,134,199,236],"can":[21,87],"schedule":[22,193],"simultaneously":[25],"as":[26,28],"long":[27],"jobs'":[30],"total":[31,107],"demand":[32],"does":[33],"not":[34,93],"exceed":[35],"server's":[37],"capacity.":[38],"This":[39,112,208],"scenario":[40],"arises":[41],"commonly":[42],"in":[43,182],"virtualization,":[44],"cloud":[45],"computing,":[46],"MapReduce":[48],"(or":[49],"Hadoop).":[50],"study":[52,119,265],"this":[53,144,234,267],"requirement":[57],"that":[58,65,165,172,187,213,246],"must":[60,68],"be":[61,69,88],"scheduled":[62],"non-preemptively,":[63],"meaning":[64],"every":[66],"job":[67,86],"completed":[70],"without":[71,160],"interruption":[72],"once":[73],"it":[74],"gets":[75],"started.":[76],"Often,":[77],"preemption":[78],"is":[79,92,114,197],"out":[80],"choice":[82],"since":[83],"preempting":[84],"prohibitively":[89],"costly":[90],"or":[91],"allowed":[94],"due":[95],"to":[96,239,258],"system":[97,196],"constraints.":[98],"focus":[100],"popular":[103],"objective":[104],"minimizing":[106],"completion":[108],"time":[109],"jobs.":[111,231],"NP":[115],"hard":[116],"hence":[117],"we":[118,146,185,243],"heuristics":[120],"provable":[122],"approximation":[123,249],"guarantees.":[124],"Succinctly,":[125],"interaction":[127],"between":[128],"two":[129],"orthogonal":[130],"quantities,":[131],"sizes":[135],"makes":[136],"decision":[139],"significantly":[140],"more":[141],"challenging.":[142],"In":[143],"paper":[145],"propose":[147],"novel":[148],"algorithms":[149,245],"for":[150,227,250,253,270],"non-uniform":[154],"homogeneous":[158],"servers":[159,226],"preemption.":[161],"first":[163,255],"observe":[164],"Smallest":[167],"Volume":[168],"First":[169],"(SVF)":[170],"algorithm":[171],"favors":[173],"smaller":[176,204],"volumes":[177],"could":[178],"perform":[179],"very":[180],"poorly":[181],"general.":[183],"However,":[184],"show":[186],"SVF":[188,214],"yields":[189],"nearly":[191],"optimal":[192],"when":[194],"overloaded":[198],"have":[201],"considerably":[203],"than":[205],"servers'":[206],"capacities.":[207],"result":[209],"supports":[210],"intuition":[212,235],"should":[215],"work":[216],"well":[217],"unless":[218],"some":[219],"high":[222],"occupy":[224],"long,":[228],"blocking":[229],"other":[230],"Building":[232],"using":[237],"reduction":[238],"geometric":[240],"packing":[241],"problems,":[242],"develop":[244],"are":[247],"constant":[248],"all":[251],"instances":[252],"time.":[256],"Prior":[257],"our":[259],"work,":[260],"there":[261],"was":[262],"no":[263],"theoretical":[264],"even":[269],"single":[272],"case.":[274]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}