{"id":"https://openalex.org/W1972843545","doi":"https://doi.org/10.1145/2392987.2393012","title":"Extending fixed task-priority schedulability by interference limitation","display_name":"Extending fixed task-priority schedulability by interference limitation","publication_year":2012,"publication_date":"2012-11-08","ids":{"openalex":"https://openalex.org/W1972843545","doi":"https://doi.org/10.1145/2392987.2393012","mag":"1972843545"},"language":"en","primary_location":{"id":"doi:10.1145/2392987.2393012","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2392987.2393012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Real-Time and Network Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/856496","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111641354","display_name":"Jos\u00e9 Manuel Silva dos Santos Marinho","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 Manuel Marinho","raw_affiliation_strings":["CISTER-ISEP/INESC-TEC, Porto, Portugal","CISTER, ISEP/INESC-TEC, Porto, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISTER-ISEP/INESC-TEC, Porto, Portugal","institution_ids":["https://openalex.org/I4210166615"]},{"raw_affiliation_string":"CISTER, ISEP/INESC-TEC, Porto, Portugal","institution_ids":["https://openalex.org/I4210166615"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062997023","display_name":"Stefan M. Petters","orcid":"https://orcid.org/0000-0002-7834-7798"},"institutions":[{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Stefan M. Petters","raw_affiliation_strings":["CISTER-ISEP/INESC-TEC, Porto, Portugal","CISTER, ISEP/INESC-TEC, Porto, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISTER-ISEP/INESC-TEC, Porto, Portugal","institution_ids":["https://openalex.org/I4210166615"]},{"raw_affiliation_string":"CISTER, ISEP/INESC-TEC, Porto, Portugal","institution_ids":["https://openalex.org/I4210166615"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106522626","display_name":"Marko Bertogna","orcid":"https://orcid.org/0000-0003-2115-4853"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marko Bertogna","raw_affiliation_strings":["University of Modena, Modena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Modena, Modena, Italy","institution_ids":["https://openalex.org/I122346577"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"191","last_page":"200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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.9991999864578247,"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.992900013923645,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.794253945350647},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.7113416194915771},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6009167432785034},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5621337890625},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5564833879470825},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.5277351140975952},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5086517930030823},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5012545585632324},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.49911952018737793},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4862431585788727},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4513605237007141},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4486062526702881},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4134068489074707},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.379518061876297},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2997135519981384},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28290724754333496},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2604014277458191},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.2464543581008911},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19745415449142456},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1580759584903717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11722278594970703},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.07712087035179138}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.794253945350647},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.7113416194915771},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6009167432785034},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5621337890625},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5564833879470825},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.5277351140975952},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5086517930030823},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5012545585632324},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49911952018737793},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4862431585788727},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4513605237007141},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4486062526702881},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4134068489074707},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.379518061876297},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2997135519981384},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28290724754333496},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2604014277458191},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2464543581008911},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19745415449142456},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1580759584903717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11722278594970703},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.07712087035179138},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":2,"locations":[{"id":"doi:10.1145/2392987.2393012","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2392987.2393012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Real-Time and Network Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.unimore.it:11380/856496","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/856496","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/856496","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/856496","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G992679310","display_name":null,"funder_award_id":"SFRH/BD/81085/2011","funder_id":"https://openalex.org/F4320338080","funder_display_name":"European Social Fund"}],"funders":[{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1539685208","https://openalex.org/W1548943549","https://openalex.org/W1997840848","https://openalex.org/W2002514423","https://openalex.org/W2040062446","https://openalex.org/W2087735050","https://openalex.org/W2095767651","https://openalex.org/W2119477620","https://openalex.org/W2123644071","https://openalex.org/W2127139412","https://openalex.org/W2147657668","https://openalex.org/W2165850270","https://openalex.org/W2169142010","https://openalex.org/W3140720277"],"related_works":["https://openalex.org/W56912691","https://openalex.org/W2171342002","https://openalex.org/W2110186189","https://openalex.org/W2314658126","https://openalex.org/W2605049164","https://openalex.org/W160191800","https://openalex.org/W2962850975","https://openalex.org/W2017977262","https://openalex.org/W2152732192","https://openalex.org/W2020074885"],"abstract_inverted_index":{"While":[0],"the":[1,16,30,59,84,104,115,133,158,163],"earliest":[2,48],"deadline":[3,49],"first":[4,50],"algorithm":[5,147],"is":[6,112,148,151],"known":[7],"to":[8,47,57,80,98,113,132],"be":[9],"optimal":[10],"as":[11],"a":[12,20,63,96,120,139,142],"uniprocessor":[13],"scheduling":[14],"policy,":[15],"implementation":[17],"comes":[18],"at":[19,83,107],"cost":[21,85],"in":[22,162],"terms":[23],"of":[24,39,61,86,95,117,119],"complexity.":[25,70],"Fixed":[26],"task-priority":[27,136],"algorithms":[28],"on":[29,126],"other":[31],"hand":[32],"have":[33,54],"lower":[34],"complexity":[35,127],"but":[36],"higher":[37],"likelihood":[38],"task":[40,64,122],"sets":[41],"being":[42],"declared":[43],"unschedulable,":[44],"when":[45,130],"compared":[46,131],"(EDF).":[51],"Various":[52],"attempts":[53],"been":[55],"undertaken":[56],"increase":[58,114],"chances":[60],"proving":[62],"set":[65],"schedulable":[66],"with":[67],"similar":[68],"low":[69],"In":[71,88],"some":[72],"cases,":[73],"this":[74,89],"was":[75],"achieved":[76],"by":[77,101],"modifying":[78],"applications":[79],"limit":[81,99],"preemptions,":[82],"flexibility.":[87],"work,":[90],"we":[91],"explore":[92],"several":[93],"variants":[94],"concept":[97],"interference":[100],"locking":[102],"down":[103],"ready":[105],"queue":[106],"certain":[108],"instances.":[109],"The":[110],"aim":[111],"prospects":[116],"schedulability":[118],"given":[121],"system,":[123],"without":[124],"compromising":[125],"or":[128],"flexibility,":[129],"regular":[134],"fixed":[135],"algorithm.":[137],"As":[138],"final":[140],"contribution,":[141],"new":[143],"preemption":[144],"threshold":[145],"assignment":[146],"provided":[149],"which":[150],"less":[152],"complex":[153],"and":[154],"more":[155],"straightforward":[156],"than":[157],"previous":[159],"method":[160],"available":[161],"literature.":[164]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}