{"id":"https://openalex.org/W2808893589","doi":"https://doi.org/10.1145/3210377.3210666","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808893589","doi":"https://doi.org/10.1145/3210377.3210666","mag":"2808893589"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210666","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210666","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210666","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210666","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047410299","display_name":"Kanthi Sarpatwar","orcid":"https://orcid.org/0000-0002-7737-1200"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kanthi Sarpatwar","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061815610","display_name":"Hadas Shachnai","orcid":"https://orcid.org/0000-0002-6645-4350"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Hadas Shachnai","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047410299"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07408984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"343","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9984999895095825,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9976000189781189,"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/schedule","display_name":"Schedule","score":0.7485858201980591},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7170857787132263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6820883750915527},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5844801068305969},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5476062893867493},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5382229089736938},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.5371874570846558},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.531683623790741},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.48119741678237915},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46591806411743164},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.412424772977829},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40950489044189453},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.176193505525589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17058852314949036},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07389995455741882}],"concepts":[{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.7485858201980591},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7170857787132263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6820883750915527},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5844801068305969},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5476062893867493},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5382229089736938},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.5371874570846558},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.531683623790741},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.48119741678237915},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46591806411743164},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.412424772977829},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40950489044189453},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.176193505525589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17058852314949036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07389995455741882},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210666","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210666","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210666","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3210377.3210666","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3210377.3210666","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3210377.3210666","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6899999976158142}],"awards":[{"id":"https://openalex.org/G3631943274","display_name":null,"funder_award_id":"CCF-144575","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4289948367","display_name":null,"funder_award_id":"CCF-1445755","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7696778097","display_name":null,"funder_award_id":"1445755","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808893589.pdf","grobid_xml":"https://content.openalex.org/works/W2808893589.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W174940708","https://openalex.org/W1596968903","https://openalex.org/W1603910973","https://openalex.org/W1606095651","https://openalex.org/W1989068254","https://openalex.org/W1996971123","https://openalex.org/W2003902046","https://openalex.org/W2007439549","https://openalex.org/W2014023522","https://openalex.org/W2015840394","https://openalex.org/W2042276676","https://openalex.org/W2054428995","https://openalex.org/W2069832779","https://openalex.org/W2074220611","https://openalex.org/W2081954069","https://openalex.org/W2117839333","https://openalex.org/W2126874118","https://openalex.org/W2139953179","https://openalex.org/W2167508111","https://openalex.org/W2172331085","https://openalex.org/W2293524428","https://openalex.org/W2395177313","https://openalex.org/W2590233228","https://openalex.org/W2606338754","https://openalex.org/W2618574501","https://openalex.org/W3194194247","https://openalex.org/W4210818019"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W601696587","https://openalex.org/W2881508932","https://openalex.org/W2794663421","https://openalex.org/W2360483549"],"abstract_inverted_index":{"Cloud":[0],"services":[1],"require":[2],"the":[3,31,35,94,100,103,111,130,138,151,181,193,197,244,271],"allocation":[4,39,92],"of":[5,34,48,54,61,93,99,129,154,196,264,275],"scarce":[6],"resources":[7,231],"to":[8,30,96,158,167,214,259],"multiple":[9],"user":[10],"requests":[11],"(jobs)":[12],"in":[13,140,180,217],"a":[14,45,51,69,72,75,78,97,125,225,260],"setting":[15,228],"that":[16,132,148,246],"facilitates":[17],"preemption":[18],"and":[19,24,50,77,143,185,232],"migration":[20],"while":[21],"respecting":[22],"resource":[23,38,85,95,112,145],"timing":[25],"constraints.":[26,113],"This":[27,253],"gives":[28],"rise":[29],"following":[32],"variants":[33],"classical":[36],"\\em":[37,119,144,182],"problem":[40],"(RAP).":[41],"The":[42],"input":[43],"is":[44,66,90,149,208,270],"set":[46,52],"J":[47],"jobs":[49,131],"M":[53,141],"homogeneous":[55],"hosts,":[56],"each":[57,212],"has":[58],"available":[59],"amount":[60],"some":[62],"resource.":[63],"A":[64,87],"job":[65,104,213],"associated":[67],"with":[68,229],"release":[70,105],"time,":[71],"due":[73,273],"date,":[74],"weight":[76,127],"given":[79],"length,":[80],"as":[81,83,108,110],"well":[82,109],"its":[84,218],"requirement.":[86],"feasible":[88],"schedule":[89,160],"an":[91,201,234],"subset":[98,128],"jobs,":[101],"satisfying":[102],"times/due":[106],"dates":[107],"We":[114,170],"consider":[115],"two":[116],"essential":[117],"objectives:":[118],"throughput":[120],"maximization":[121],"(MaxT),":[122],"which":[123,175],"seeks":[124],"maximum":[126,272],"can":[133,255],"be":[134,168,215,256],"feasibly":[135,159],"scheduled":[136],"on":[137],"hosts":[139,156],",":[142],"minimization":[146],"(MinM),":[147],"finding":[150],"minimum":[152],"number":[153],"(homogeneous)":[155],"needed":[157],"all":[161],"jobs.":[162],"Both":[163],"problems":[164],"are":[165,249],"known":[166],"NP-hard.":[169],"address":[171],"these":[172],"fundamental":[173],"problems,":[174],"have":[176],"been":[177],"studied":[178],"previously":[179],"non-preemptive":[183],"model,":[184],"develop":[186],"novel":[187],"techniques":[188],"for":[189,204,211,237],"tackling":[190],"them.":[191],"In":[192],"full":[194],"version":[195],"paper,":[198],"we":[199,223],"present":[200],"$\u00d8mega(1)$-approximation":[202],"algorithm":[203],"MaxT,":[205],"assuming":[206],"there":[207],"sufficient":[209],"slack":[210],"completed":[216],"time":[219,247],"window.":[220],"For":[221],"MinM,":[222],"study":[224],"more":[226],"general":[227],"d":[230],"derive":[233],"$O(\u0142og":[235,265],"d)$-approximation":[236],"any":[238,276],"fixed":[239],"$d":[240],"\\geq":[241],"1$,":[242],"under":[243],"assumption":[245,254],"windows":[248],"not":[250],"too":[251],"small.":[252],"removed,":[257],"leading":[258],"slightly":[261],"worse":[262],"ratio":[263],"d\u0142og^*":[266],"T)$,":[267],"where":[268],"T":[269],"date":[274],"job.":[277]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2018-06-29T00:00:00"}