{"id":"https://openalex.org/W2808803595","doi":"https://doi.org/10.1145/3210377.3210407","title":"The Price of Bounded Preemption","display_name":"The Price of Bounded Preemption","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808803595","doi":"https://doi.org/10.1145/3210377.3210407","mag":"2808803595"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210407","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210407","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085063619","display_name":"Mark Berlin","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Mark Berlin","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.2463,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61919263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9937000274658203,"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/preemption","display_name":"Preemption","score":0.8385313749313354},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.727696418762207},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6872810125350952},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5373564958572388},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.48829102516174316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4855603873729706},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4502137303352356},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4494855999946594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4058391749858856},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35431545972824097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2580224573612213},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10397079586982727}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8385313749313354},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.727696418762207},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6872810125350952},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5373564958572388},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.48829102516174316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4855603873729706},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4502137303352356},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4494855999946594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4058391749858856},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35431545972824097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2580224573612213},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10397079586982727},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210407","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210407","pdf_url":null,"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":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G2246785707","display_name":null,"funder_award_id":"1506/16","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1572977974","https://openalex.org/W1975122098","https://openalex.org/W1986168186","https://openalex.org/W2001532889","https://openalex.org/W2003902046","https://openalex.org/W2007439549","https://openalex.org/W2008126942","https://openalex.org/W2010484711","https://openalex.org/W2015429079","https://openalex.org/W2018130631","https://openalex.org/W2069532962","https://openalex.org/W2069832779","https://openalex.org/W2081954069","https://openalex.org/W2086491340","https://openalex.org/W2107216979","https://openalex.org/W2126132735","https://openalex.org/W2135522804","https://openalex.org/W2140576536","https://openalex.org/W2161734639","https://openalex.org/W2165102171","https://openalex.org/W2169142010","https://openalex.org/W2294519362","https://openalex.org/W2401610261","https://openalex.org/W2559397759","https://openalex.org/W2569786510"],"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/W2389216462","https://openalex.org/W4387006201"],"abstract_inverted_index":{"In":[0],"this":[1,183],"paper":[2],"we":[3,210],"provide":[4],"a":[5,17,27,45,65,80,84,127,174,230,235],"tight":[6,236],"bound":[7,170,237,261],"for":[8,13,171,238],"the":[9,68,99,106,111,135,140,149,152,156,159,163,172,180,198,208,212,215,222,226,239,251,254,260,263,266],"price":[10,95,199],"of":[11,26,29,35,67,79,96,105,134,142,151,158,182,207,214,224,229,253,265],"preemption":[12,78,97],"scheduling":[14,109],"jobs":[15,30,69,153],"on":[16,262],"single":[18],"machine":[19],"(or":[20],"multiple":[21],"machines).":[22],"The":[23,59,94],"input":[24],"consists":[25],"set":[28],"to":[31,62,110,125,162,178],"be":[32,87],"scheduled":[33],"and":[34,54,154,233,257],"an":[36,168],"integer":[37],"parameter":[38],"$k":[39],"\\ge":[40],"1$.":[41],"Each":[42],"job":[43,81,85],"has":[44],"release":[46],"time,":[47],"deadline,":[48],"length":[49,161],"(also":[50],"called":[51],"processing":[52],"time)":[53],"value":[55,74,137],"associated":[56],"with":[57],"it.":[58],"goal":[60],"is":[61,75,82,98,144,148,200,243,250,259],"feasibly":[63],"schedule":[64],"subset":[66],"so":[70],"that":[71,118,188],"their":[72],"total":[73,136],"maximal;":[76],"while":[77],"permitted,":[83],"may":[86],"preempted":[88],"no":[89,190],"more":[90],"than":[91],"k":[92,122,258],"times.":[93],"worst":[100],"possible":[101],"(i.e.,":[102,196],"largest)":[103],"ratio":[104,157],"optimal":[107,112],"non-bounded-preemptive":[108],"k-bounded-preemptive":[113],"scheduling.":[114],"Our":[115],"results":[116],"show":[117,187],"allowing":[119],"at":[120,194],"most":[121],"preemptions":[123,143,191],"suffices":[124],"guarantee":[126],"\u0398(\\min\\\u0142og_k+1":[128],"n,":[129],"\u0142og_k+1":[130],"P\\":[131,203],")$":[132],"fraction":[133],"achieved":[138],"when":[139,189],"number":[141,150],"unrestricted":[145],"(where":[146],"n":[147,249],"P":[155],"maximal":[160],"minimal":[164],"length),":[165],"giving":[166],"us":[167],"upper":[169],"price;":[173],"specific":[175],"scenario":[176],"serves":[177],"prove":[179],"tightness":[181],"bound.":[184],"We":[185,220],"further":[186],"are":[192],"permitted":[193],"all":[195],"k=0),":[197],"\u0398(\\min\\n,":[201],"\u0142og":[202],")$.":[204],"As":[205],"part":[206],"proof,":[209],"introduce":[211],"notion":[213],"Bounded-Degree":[216],"Ancestor-Free":[217],"Sub-Forest":[218],"(BAS).":[219],"investigate":[221],"problem":[223],"computing":[225],"maximal-value":[227],"BAS":[228],"given":[231],"forest":[232,256],"give":[234],"loss":[240],"factor,":[241],"which":[242],"\u0398(\u0142og_k+1":[244],"n)$":[245],"as":[246],"well,":[247],"where":[248],"size":[252],"original":[255],"degree":[264],"sub-forest.":[267]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}