{"id":"https://openalex.org/W2157307034","doi":"https://doi.org/10.1109/tc.2003.1234530","title":"An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems","display_name":"An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2157307034","doi":"https://doi.org/10.1109/tc.2003.1234530","mag":"2157307034"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1234530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1234530","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5003849356","display_name":"George Lima","orcid":"https://orcid.org/0000-0002-8468-5224"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"G.M. de A. Lima","raw_affiliation_strings":["Real-time Systems Research Group, Department of Computer Scienc, University of York, York, UK"],"affiliations":[{"raw_affiliation_string":"Real-time Systems Research Group, Department of Computer Scienc, University of York, York, UK","institution_ids":["https://openalex.org/I52099693"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049937500","display_name":"Alan Burns","orcid":"https://orcid.org/0000-0001-5621-8816"},"institutions":[{"id":"https://openalex.org/I52099693","display_name":"University of York","ror":"https://ror.org/04m01e293","country_code":"GB","type":"education","lineage":["https://openalex.org/I52099693"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Burns","raw_affiliation_strings":["Real-time Systems Research Group, Department of Computer Scienc, University of York, York, UK"],"affiliations":[{"raw_affiliation_string":"Real-time Systems Research Group, Department of Computer Scienc, University of York, York, UK","institution_ids":["https://openalex.org/I52099693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003849356"],"corresponding_institution_ids":["https://openalex.org/I52099693"],"apc_list":null,"apc_paid":null,"fwci":1.9817,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.87216919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"52","issue":"10","first_page":"1332","last_page":"1346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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.9998999834060669,"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.9951000213623047,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9822999835014343,"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.7726122736930847},{"id":"https://openalex.org/keywords/resilience","display_name":"Resilience (materials science)","score":0.6789149641990662},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.6464739441871643},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6461855173110962},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.49424055218696594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4942076504230499},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.48862534761428833},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.47795677185058594},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.440400630235672},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.43800705671310425},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3490352928638458},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18974074721336365},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.1663329005241394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12004965543746948},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.10875391960144043},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1067064106464386},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08090001344680786}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7726122736930847},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.6789149641990662},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.6464739441871643},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6461855173110962},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.49424055218696594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4942076504230499},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.48862534761428833},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.47795677185058594},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.440400630235672},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.43800705671310425},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3490352928638458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18974074721336365},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.1663329005241394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12004965543746948},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.10875391960144043},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1067064106464386},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08090001344680786},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tc.2003.1234530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1234530","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.547.5454","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.547.5454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.whiterose.ac.uk/1453/1/burnsa1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.664.9577","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.664.9577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.whiterose.ac.uk/1453/1/burnsa1.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.whiterose.ac.uk:1453","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-5621-8816>","pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5452421812","display_name":null,"funder_award_id":"CAPES/","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"},{"id":"https://openalex.org/G692611148","display_name":null,"funder_award_id":"Brazil","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W121092586","https://openalex.org/W1513791477","https://openalex.org/W1523509419","https://openalex.org/W1599676434","https://openalex.org/W1744830798","https://openalex.org/W1886800870","https://openalex.org/W1894770881","https://openalex.org/W1897593416","https://openalex.org/W1935947664","https://openalex.org/W1970967610","https://openalex.org/W1991708881","https://openalex.org/W2042979415","https://openalex.org/W2086061827","https://openalex.org/W2105145159","https://openalex.org/W2109488193","https://openalex.org/W2116214478","https://openalex.org/W2117441930","https://openalex.org/W2124870954","https://openalex.org/W2135856782","https://openalex.org/W2165172064","https://openalex.org/W2167200329","https://openalex.org/W2436326048","https://openalex.org/W3216677828","https://openalex.org/W4242346029","https://openalex.org/W6604947759","https://openalex.org/W6635826932"],"related_works":["https://openalex.org/W2364408853","https://openalex.org/W2186454171","https://openalex.org/W2133311116","https://openalex.org/W2372058405","https://openalex.org/W1602037586","https://openalex.org/W1591583623","https://openalex.org/W2382660099","https://openalex.org/W2037055167","https://openalex.org/W53305329","https://openalex.org/W2029789321"],"abstract_inverted_index":{"The":[0,83,126,199],"main":[1],"contribution":[2],"of":[3,32,95,120,135,168,189,201],"this":[4],"paper":[5],"is":[6,106,138,165,180,192,205],"twofold.":[7],"First,":[8],"we":[9,41,173],"present":[10],"an":[11,111,150],"appropriate":[12,77,151],"schedulability":[13,55,85],"analysis,":[14,19,56,137],"based":[15],"on":[16],"response":[17],"time":[18,121],"for":[20,195],"supporting":[21],"fault-tolerant":[22],"hard":[23],"real-time":[24],"systems.":[25],"We":[26,141],"consider":[27],"systems":[28],"that":[29,68,92,143,175,185],"make":[30],"use":[31],"error-recovery":[33],"techniques":[34],"to":[35,57,122,147,160],"carry":[36],"out":[37,149],"fault":[38,60,187],"tolerance.":[39],"Second,":[40],"propose":[42],"a":[43,113,117],"new":[44],"priority":[45,70,102,128,152,177],"assignment":[46,71,129,153,178],"algorithm":[47,179],"which":[48,131],"can":[49],"be":[50,76,98],"used,":[51],"together":[52],"with":[53],"the":[54,66,90,93,136,144,155,166,176,183,186,196,202],"improve":[58],"system":[59],"resilience.":[61],"These":[62],"achievements":[63],"come":[64],"from":[65,158],"observation":[67],"traditional":[69],"policies":[72],"may":[73,97],"no":[74],"longer":[75],"when":[78],"faults":[79],"are":[80],"being":[81],"considered.":[82],"proposed":[84,127,197,203],"analysis":[86],"takes":[87],"into":[88],"account":[89],"fact":[91],"recoveries":[94],"tasks":[96],"executed":[99],"at":[100],"higher":[101],"levels.":[103],"This":[104],"characteristic":[105],"very":[107,139],"important":[108],"since,":[109],"after":[110],"error,":[112],"task":[114,169,190],"certainly":[115],"has":[116],"shorter":[118],"period":[119],"meet":[123],"its":[124],"deadline.":[125],"algorithm,":[130],"uses":[132],"some":[133],"properties":[134],"efficient.":[140],"show":[142,174],"method":[145],"used":[146],"find":[148],"reduces":[154],"search":[156],"space":[157],"O(n!)":[159],"O(n/sup":[161],"2/),":[162],"where":[163],"n":[164],"number":[167],"recovery":[170],"procedures.":[171],"Also,":[172],"optimal":[181],"in":[182],"sense":[184],"resilience":[188],"sets":[191],"maximized":[193],"as":[194],"analysis.":[198],"effectiveness":[200],"approach":[204],"evaluated":[206],"by":[207],"simulation.":[208]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}