{"id":"https://openalex.org/W2987329820","doi":"https://doi.org/10.1145/3356401.3356407","title":"Choosing preemption points to minimize typical running times","display_name":"Choosing preemption points to minimize typical running times","publication_year":2019,"publication_date":"2019-11-05","ids":{"openalex":"https://openalex.org/W2987329820","doi":"https://doi.org/10.1145/3356401.3356407","mag":"2987329820"},"language":"en","primary_location":{"id":"doi:10.1145/3356401.3356407","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3356401.3356407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th International Conference on Real-Time Networks and Systems","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/A5038442224","display_name":"Sanjoy Baruah","orcid":"https://orcid.org/0000-0002-4541-3445"},"institutions":[{"id":"https://openalex.org/I204465549","display_name":"Washington University in St. Louis","ror":"https://ror.org/01yc7t268","country_code":"US","type":"education","lineage":["https://openalex.org/I204465549"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjoy Baruah","raw_affiliation_strings":["Washington University in St. Louis"],"affiliations":[{"raw_affiliation_string":"Washington University in St. Louis","institution_ids":["https://openalex.org/I204465549"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063909745","display_name":"Nathan Fisher","orcid":"https://orcid.org/0000-0002-9733-3842"},"institutions":[{"id":"https://openalex.org/I185443292","display_name":"Wayne State University","ror":"https://ror.org/01070mq45","country_code":"US","type":"education","lineage":["https://openalex.org/I185443292"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nathan Fisher","raw_affiliation_strings":["Wayne State University"],"affiliations":[{"raw_affiliation_string":"Wayne State University","institution_ids":["https://openalex.org/I185443292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038442224"],"corresponding_institution_ids":["https://openalex.org/I204465549"],"apc_list":null,"apc_paid":null,"fwci":0.2408,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5150013,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"198","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9914000034332275,"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.9747958779335022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7697020769119263},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6284180879592896},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.546619713306427},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4556548595428467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3336039185523987},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.33090120553970337},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.23823609948158264},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.163885235786438},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14052030444145203}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.9747958779335022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7697020769119263},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6284180879592896},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.546619713306427},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4556548595428467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3336039185523987},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33090120553970337},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.23823609948158264},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.163885235786438},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14052030444145203}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3356401.3356407","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3356401.3356407","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th International Conference on Real-Time Networks and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1524129009","https://openalex.org/W1539685208","https://openalex.org/W1543990864","https://openalex.org/W1573956714","https://openalex.org/W1587185226","https://openalex.org/W1985667642","https://openalex.org/W2009133267","https://openalex.org/W2049181211","https://openalex.org/W2078294334","https://openalex.org/W2078921946","https://openalex.org/W2080059420","https://openalex.org/W2086061827","https://openalex.org/W2088046398","https://openalex.org/W2096147951","https://openalex.org/W2109386398","https://openalex.org/W2110186189","https://openalex.org/W2127467256","https://openalex.org/W2135522804","https://openalex.org/W2136910062","https://openalex.org/W2137189977","https://openalex.org/W2139566576","https://openalex.org/W2140007886","https://openalex.org/W2143323523","https://openalex.org/W2146412113","https://openalex.org/W2161734639","https://openalex.org/W2166417881","https://openalex.org/W2166718050","https://openalex.org/W2169142010","https://openalex.org/W2401610261","https://openalex.org/W4210901217","https://openalex.org/W4255529553"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W2000785801","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W986318368","https://openalex.org/W601696587","https://openalex.org/W2056396287"],"abstract_inverted_index":{"The":[0],"problem":[1,38],"of":[2,66,102,154,200,202,215,219,223,226,230],"selecting":[3],"\"effective":[4],"preemption":[5,19,76,91,137,155,187,204],"points\"":[6],"in":[7,12,21,44,62,93,121,157],"a":[8,94,116,158],"program":[9,104],"---":[10,20],"points":[11,61,92,156,188,205],"the":[13,53,63,67,73,98,103,136,140,151,162,176,198,203,216,224],"code":[14,74],"at":[15,59],"which":[16,45,122,185],"to":[17,23,56,70,88,132,169,192],"permit":[18],"order":[22],"minimize":[24],"overall":[25,99,164],"running":[26,165,179],"time":[27,68,101,166],"is":[28,206],"considered.":[29],"Prior":[30],"solutions":[31,80,183,196],"that":[32,160],"have":[33],"been":[34],"proposed":[35],"for":[36,52,135,150],"this":[37],"are":[39,50,81,130,189,232],"based":[40,82],"on":[41,83,175],"workload":[42,119],"models":[43],"worst-case":[46,84,177],"known":[47,134],"upper":[48,128,173],"bounds":[49,174],"assumed":[51,131],"duration":[54],"needed":[55,69],"perform":[57],"preemptions":[58,221],"particular":[60],"code,":[64],"and":[65,139,194,210,222,234],"non-preemptively":[71],"execute":[72],"between":[75],"points.":[77],"Since":[78],"these":[79],"assumptions,":[85],"they":[86],"tend":[87],"select":[89],"effective":[90],"conservative":[95],"manner;":[96],"consequently":[97],"execution":[100],"may":[105],"be":[106,133],"needlessly":[107],"large":[108],"under":[109],"most":[110],"typical":[111,163],"run-time":[112,209],"circumstances.":[113],"We":[114],"consider":[115],"more":[117],"general":[118],"model":[120],"\"typical\"":[123],"values,":[124],"as":[125,127],"well":[126],"bounds,":[129],"durations":[138,218],"non-preemptive":[141],"code-execution":[142],"durations;":[143],"given":[144],"such":[145],"information,":[146],"we":[147],"derive":[148],"algorithms":[149],"optimal":[152],"placement":[153],"manner":[159],"minimizes":[161],"(while":[167],"continuing":[168],"guarantee,":[170],"if":[171],"needed,":[172],"over-all":[178],"time).":[180],"Both":[181],"off-line":[182],"(in":[184],"all":[186],"selected":[190],"prior":[191,220],"run-time)":[193],"on-line":[195],"(where":[197],"selection":[199],"some":[201],"made":[207],"during":[208],"therefore":[211],"can":[212],"exploit":[213],"knowledge":[214],"actual":[217],"executions":[225],"already":[227],"executed":[228],"pieces":[229],"code)":[231],"presented":[233],"proved":[235],"optimal.":[236]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
