{"id":"https://openalex.org/W2578830708","doi":"https://doi.org/10.1145/3199610.3199616","title":"Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling","display_name":"Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling","publication_year":2018,"publication_date":"2018-03-20","ids":{"openalex":"https://openalex.org/W2578830708","doi":"https://doi.org/10.1145/3199610.3199616","mag":"2578830708"},"language":"en","primary_location":{"id":"doi:10.1145/3199610.3199616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3199610.3199616","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","raw_type":"journal-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/A5027719943","display_name":"Leo Hatvani","orcid":"https://orcid.org/0000-0003-0073-1674"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Leo Hatvani","raw_affiliation_strings":["Technische Universiteit, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Technische Universiteit, The Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087200263","display_name":"Sara Afshar","orcid":"https://orcid.org/0000-0001-8654-2211"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Sara Afshar","raw_affiliation_strings":["M\u00e4lardalen University (MDH), V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University (MDH), V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080745161","display_name":"Reinder J. Bril","orcid":"https://orcid.org/0000-0001-6234-5117"},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Reinder J. Bril","raw_affiliation_strings":["Technische Universiteit, The Netherlands and M\u00e4lardalen University (MDH), V\u00e4ster\u00e5s, Sweden"],"affiliations":[{"raw_affiliation_string":"Technische Universiteit, The Netherlands and M\u00e4lardalen University (MDH), V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5027719943"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2525,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45282327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"15","issue":"1","first_page":"43","last_page":"49"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9868999719619751,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9807000160217285,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9273583292961121},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6985680460929871},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.641294002532959},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5952949523925781},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46877068281173706},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4493577182292938},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36875617504119873},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.36271989345550537},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.35997363924980164},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3170408010482788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1513272523880005}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.9273583292961121},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6985680460929871},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.641294002532959},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5952949523925781},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46877068281173706},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4493577182292938},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36875617504119873},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.36271989345550537},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.35997363924980164},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3170408010482788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1513272523880005},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3199610.3199616","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3199610.3199616","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1539685208","https://openalex.org/W1545644724","https://openalex.org/W1910758455","https://openalex.org/W1997840848","https://openalex.org/W2000129271","https://openalex.org/W2123644071","https://openalex.org/W2126132735","https://openalex.org/W2135522804","https://openalex.org/W2141440050","https://openalex.org/W2147594675","https://openalex.org/W2169142010","https://openalex.org/W2336306883"],"related_works":["https://openalex.org/W2393789493","https://openalex.org/W2374555443","https://openalex.org/W2962323017","https://openalex.org/W1827860574","https://openalex.org/W2352790745","https://openalex.org/W2386407620","https://openalex.org/W2367142822","https://openalex.org/W2167574351","https://openalex.org/W2375726820","https://openalex.org/W2377321505"],"abstract_inverted_index":{"Fixed-priority":[0],"preemption-threshold":[1],"scheduling":[2,10,15],"(FPTS)":[3],"is":[4,53,61,139],"a":[5,63,66,98,196,199,220],"generalization":[6],"of":[7,25,119,122,130,148,175,212],"fixed-priority":[8,13],"preemptive":[9],"(FPPS)":[11],"and":[12,19,44,65,102,126,151,158],"non-preemptive":[14],"(FPNS).":[16],"Since":[17],"FPPS":[18,41],"FPNS":[20,43],"are":[21,47,71],"incomparable":[22],"in":[23,111,117,210],"terms":[24,118,211],"potential":[26,149],"schedulability,":[27],"FPTS":[28,52,109],"has":[29],"the":[30,56,74,92,114,120,123,127,146,160,167,173,176,180,186,191,204],"advantage":[31],"that":[32,46,58,87,185,206],"it":[33,144],"can":[34,81,207],"schedule":[35],"any":[36],"task":[37,60],"set":[38],"schedulable":[39,49],"by":[40,50,85,215],"or":[42],"some":[45],"not":[48],"either.":[51],"based":[54,140],"on":[55,141],"idea":[57],"each":[59],"assigned":[62],"priority":[64,89,101,223],"preemption":[67,93,103,152],"threshold.":[68,94],"While":[69],"tasks":[70,86],"admitted":[72],"into":[73],"system":[75],"according":[76],"to":[77,194,219],"their":[78],"priorities,":[79],"they":[80],"only":[82],"be":[83,208],"preempted":[84],"have":[88],"higher":[90],"than":[91],"This":[95],"paper":[96],"presents":[97],"new":[99,177,187],"optimal":[100],"threshold":[104],"assignment":[105,162],"(OPTA)":[106],"algorithm":[107,138,178,188],"for":[108],"which":[110],"general":[112],"outperforms":[113],"existing":[115,181],"algorithms":[116],"size":[121],"explored":[124],"state-space":[125],"total":[128],"number":[129],"worst":[131],"case":[132],"response":[133],"time":[134,192],"calculations":[135],"performed.":[136],"The":[137],"back-tracking,":[142],"i.e.":[143],"traverses":[145],"space":[147],"priorities":[150],"thresholds,":[153],"while":[154],"pruning":[155],"infeasible":[156],"paths,":[157],"returns":[159],"first":[161],"deemed":[163],"schedulable.":[164],"We":[165,183],"present":[166],"evaluation":[168],"results":[169],"where":[170],"we":[171,202],"compare":[172],"complexity":[174],"with":[179],"one.":[182],"show":[184,203],"significantly":[189],"reduces":[190],"needed":[193],"find":[195],"solution.":[197],"Through":[198],"comparative":[200],"evaluation,":[201],"improvements":[205],"achieved":[209],"schedulability":[213],"ratio":[214],"our":[216],"OPTA":[217],"compared":[218],"deadline":[221],"monotonic":[222],"assignment.":[224]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}