{"id":"https://openalex.org/W2109118153","doi":"https://doi.org/10.1109/tc.2004.1261839","title":"A utilization bound for aperiodic tasks and priority driven scheduling","display_name":"A utilization bound for aperiodic tasks and priority driven scheduling","publication_year":2004,"publication_date":"2004-02-24","ids":{"openalex":"https://openalex.org/W2109118153","doi":"https://doi.org/10.1109/tc.2004.1261839","mag":"2109118153"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2004.1261839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2004.1261839","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/A5087114395","display_name":"Tarek Abdelzaher","orcid":"https://orcid.org/0000-0003-3883-7220"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T.F. Abdelzaher","raw_affiliation_strings":["Department of Computer Science, University of Virginia, Charlottesville, VA, USA","Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA#TAB#","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101453018","display_name":"Vivek Sharma","orcid":"https://orcid.org/0000-0002-8896-0254"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Sharma","raw_affiliation_strings":["Department of Computer Science, University of Virginia, Charlottesville, VA, USA","Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA#TAB#","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034805517","display_name":"Chenyang Lu","orcid":"https://orcid.org/0000-0003-1709-6769"},"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":false,"raw_author_name":"Chenyang Lu","raw_affiliation_strings":["Department of Computer Science, Washington University, Saint Louis, MO, USA","Dept. of Comput. Sci., Washington Univ., Saint Louis, MO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Washington University, Saint Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Washington Univ., Saint Louis, MO, USA","institution_ids":["https://openalex.org/I204465549"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087114395"],"corresponding_institution_ids":["https://openalex.org/I51556381"],"apc_list":null,"apc_paid":null,"fwci":7.9388,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.97764476,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"53","issue":"3","first_page":"334","last_page":"350"},"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.9919999837875366,"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.9909999966621399,"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/aperiodic-graph","display_name":"Aperiodic graph","score":0.9556612968444824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7793400287628174},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6963689923286438},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6851822137832642},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5191242098808289},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.47009631991386414},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.42778605222702026},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.40229031443595886},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3812870681285858},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3165662884712219},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29452818632125854},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20459771156311035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18028318881988525},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.17829754948616028},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12109285593032837}],"concepts":[{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.9556612968444824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7793400287628174},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6963689923286438},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6851822137832642},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5191242098808289},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.47009631991386414},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.42778605222702026},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.40229031443595886},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3812870681285858},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3165662884712219},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29452818632125854},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20459771156311035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18028318881988525},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.17829754948616028},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12109285593032837},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2004.1261839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2004.1261839","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W116292536","https://openalex.org/W1563292128","https://openalex.org/W1568809964","https://openalex.org/W1943292024","https://openalex.org/W1970351267","https://openalex.org/W1973485586","https://openalex.org/W1993900629","https://openalex.org/W2001200190","https://openalex.org/W2002016612","https://openalex.org/W2004594807","https://openalex.org/W2005239962","https://openalex.org/W2015284701","https://openalex.org/W2043184813","https://openalex.org/W2046662881","https://openalex.org/W2071161955","https://openalex.org/W2076364559","https://openalex.org/W2096441239","https://openalex.org/W2096989632","https://openalex.org/W2097307972","https://openalex.org/W2099520428","https://openalex.org/W2102081791","https://openalex.org/W2102166244","https://openalex.org/W2109488193","https://openalex.org/W2119358936","https://openalex.org/W2123322045","https://openalex.org/W2129745701","https://openalex.org/W2130988148","https://openalex.org/W2134202349","https://openalex.org/W2140936050","https://openalex.org/W2142837543","https://openalex.org/W2149833774","https://openalex.org/W2151208617","https://openalex.org/W2158002367","https://openalex.org/W2160498682","https://openalex.org/W2166440675","https://openalex.org/W2166573642","https://openalex.org/W2168413716","https://openalex.org/W2170148670","https://openalex.org/W2170231009","https://openalex.org/W2180341352","https://openalex.org/W2250292136","https://openalex.org/W2262960161","https://openalex.org/W2489688296","https://openalex.org/W2543632133","https://openalex.org/W2555657893","https://openalex.org/W2570030068","https://openalex.org/W2610896884","https://openalex.org/W3004404394","https://openalex.org/W4254812284","https://openalex.org/W6606640937","https://openalex.org/W6654157674"],"related_works":["https://openalex.org/W2393789493","https://openalex.org/W2374555443","https://openalex.org/W2367142822","https://openalex.org/W2184166483","https://openalex.org/W2060984508","https://openalex.org/W2352790745","https://openalex.org/W2383668729","https://openalex.org/W2167574351","https://openalex.org/W2245286458","https://openalex.org/W2076947091"],"abstract_inverted_index":{"Real-time":[0],"scheduling":[1,57,104,118],"theory":[2,58],"offers":[3],"constant-time":[4,88],"schedulability":[5,60,69,89,124],"tests":[6,90],"for":[7,68,102],"periodic":[8],"and":[9,46,59,136,153],"sporadic":[10],"tasks":[11,107],"based":[12,76],"on":[13,77],"utilization":[14,100],"bounds.":[15],"Unfortunately,":[16],"the":[17,20,64,98,147,150],"periodicity":[18],"or":[19],"minimal":[21],"interarrival-time":[22],"assumptions":[23],"underlying":[24],"these":[25],"bounds":[26],"make":[27],"them":[28],"inapplicable":[29],"to":[30],"a":[31,78,122,132,142],"vast":[32],"range":[33],"of":[34,70,105,134,149],"aperiodic":[35,71,106],"workloads":[36],"such":[37],"as":[38],"those":[39],"seen":[40],"by":[41],"network":[42],"routers,":[43],"Web":[44],"servers,":[45],"event-driven":[47],"systems.":[48],"This":[49],"paper":[50],"makes":[51],"several":[52],"important":[53],"contributions":[54],"toward":[55],"real-time":[56],"analysis.":[61],"We":[62,95,111,145],"derive":[63],"first":[65],"known":[66],"bound":[67,74,101,133,152],"tasks.":[72],"The":[73],"is":[75,108,157],"utilization-like":[79],"metric":[80],"we":[81,127],"call":[82],"synthetic":[83,99],"utilization,":[84],"which":[85],"allows":[86],"implementing":[87],"at":[91],"admission":[92],"control":[93],"time.":[94],"prove":[96],"that":[97,114,129,137,155],"deadline-monotonic":[103],"1/1+/spl":[109],"radic/1/2.":[110],"also":[112],"show":[113,128],"no":[115,138],"other":[116],"time-independent":[117],"policy":[119,140],"can":[120],"have":[121],"higher":[123,143],"bound.":[125,144],"Similarly,":[126],"EDF":[130],"has":[131,141],"1":[135],"dynamic-priority":[139],"assess":[146],"performance":[148],"derived":[151],"conclude":[154],"it":[156],"very":[158],"efficient":[159],"in":[160],"hit-ratio":[161],"maximization.":[162]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}