{"id":"https://openalex.org/W2099238564","doi":"https://doi.org/10.1109/rtas.2008.7","title":"Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems","display_name":"Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2099238564","doi":"https://doi.org/10.1109/rtas.2008.7","mag":"2099238564"},"language":"en","primary_location":{"id":"doi:10.1109/rtas.2008.7","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2008.7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","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":null,"display_name":"Sanjoy Baruah","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]},{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjoy Baruah","raw_affiliation_strings":["North Carolina State University, USA","North Carolina Univ. - Chapel Hill, Chapel Hill, NC"],"affiliations":[{"raw_affiliation_string":"North Carolina State University, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"North Carolina Univ. - Chapel Hill, Chapel Hill, NC","institution_ids":["https://openalex.org/I114027177"]}]},{"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, USA","Computer Science, Automotive Safety Group"],"affiliations":[{"raw_affiliation_string":"Wayne State University, USA","institution_ids":["https://openalex.org/I185443292"]},{"raw_affiliation_string":"Computer Science, Automotive Safety Group","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114027177","https://openalex.org/I137902535"],"apc_list":null,"apc_paid":null,"fwci":1.0361,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.80501624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"248","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9993000030517578,"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.9993000030517578,"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.9621999859809875,"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.960099995136261,"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/computer-science","display_name":"Computer science","score":0.7670322060585022},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.7189475297927856},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.718651294708252},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6876947283744812},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.6797193288803101},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6766151189804077},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.6162838339805603},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6083489060401917},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.605623185634613},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5498292446136475},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.4984414577484131},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49788403511047363},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2826111316680908},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2331860065460205},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23164835572242737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09076756238937378},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.053211718797683716}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7670322060585022},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.7189475297927856},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.718651294708252},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6876947283744812},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.6797193288803101},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6766151189804077},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.6162838339805603},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6083489060401917},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.605623185634613},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5498292446136475},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.4984414577484131},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49788403511047363},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2826111316680908},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2331860065460205},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23164835572242737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09076756238937378},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.053211718797683716},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rtas.2008.7","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtas.2008.7","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Real-Time and Embedded Technology and Applications Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.533.6914","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.533.6914","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/cpsweek08/papers/rtas08/6C.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W194244820","https://openalex.org/W1485093219","https://openalex.org/W1488048951","https://openalex.org/W1500315091","https://openalex.org/W1548943549","https://openalex.org/W1595529246","https://openalex.org/W2009415693","https://openalex.org/W2034833774","https://openalex.org/W2042979415","https://openalex.org/W2086061827","https://openalex.org/W2093100591","https://openalex.org/W2103402149","https://openalex.org/W2109488193","https://openalex.org/W2111206806","https://openalex.org/W2116561566","https://openalex.org/W2119167559","https://openalex.org/W2121922965","https://openalex.org/W2127467256","https://openalex.org/W2130845347","https://openalex.org/W2133620741","https://openalex.org/W2137784941","https://openalex.org/W2155801247","https://openalex.org/W2166440675","https://openalex.org/W2166718050","https://openalex.org/W2170091282","https://openalex.org/W2262960161","https://openalex.org/W2546478402","https://openalex.org/W2726481301","https://openalex.org/W4245231257","https://openalex.org/W4246142437","https://openalex.org/W6629205730","https://openalex.org/W6632862181","https://openalex.org/W6678315453","https://openalex.org/W6729472962"],"related_works":["https://openalex.org/W2172075652","https://openalex.org/W1840932120","https://openalex.org/W2912206708","https://openalex.org/W4300092030","https://openalex.org/W2377321505","https://openalex.org/W1935185185","https://openalex.org/W4381889969","https://openalex.org/W2393789493","https://openalex.org/W2098651083","https://openalex.org/W2167574351"],"abstract_inverted_index":{"A":[0],"hybrid":[1,26,74],"scheduling":[2,19,27,65,75],"algorithm":[3,28],"is":[4,22,29,59],"proposed,":[5],"which":[6],"integrates":[7],"features":[8,47],"of":[9,32,42,48,66],"the":[10,43,62,84],"fixed":[11],"priority":[12],"(FP)":[13],"and":[14,35,37,46,56],"earliest":[15],"deadline":[16],"first":[17],"(EDF)":[18],"policies.":[20,51],"It":[21],"shown":[23],"that":[24],"this":[25,73],"a":[30],"generalization":[31],"both":[33,49],"FP":[34],"EDF,":[36],"tends":[38],"to":[39,79],"retain":[40],"most":[41],"desirable":[44],"properties":[45],"individual":[50],"An":[52],"exact":[53],"(i.e.,":[54],"necessary":[55],"sufficient)":[57],"test":[58],"derived":[60],"for":[61],"preemptive":[63],"uniprocessor":[64],"resource-":[67],"sharing":[68],"sporadic":[69],"task":[70],"systems":[71],"using":[72,83],"algorithm,":[76],"with":[77],"access":[78],"shared":[80],"resources":[81],"arbitrated":[82],"stack":[85],"resource":[86],"policy":[87],"(SRP).":[88]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}