{"id":"https://openalex.org/W2130938721","doi":"https://doi.org/10.1109/rtcsa.1995.528743","title":"The many faces of multi-level real-time scheduling","display_name":"The many faces of multi-level real-time scheduling","publication_year":2002,"publication_date":"2002-11-19","ids":{"openalex":"https://openalex.org/W2130938721","doi":"https://doi.org/10.1109/rtcsa.1995.528743","mag":"2130938721"},"language":"en","primary_location":{"id":"doi:10.1109/rtcsa.1995.528743","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtcsa.1995.528743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","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":"https://openalex.org/A5100603760","display_name":"John A. Stankovic","orcid":"https://orcid.org/0000-0001-7307-9395"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J.A. Stankovic","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, MA, USA","Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100603760"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.2053,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.47898394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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.9995999932289124,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.8009926080703735},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.7298858165740967},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7293739318847656},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6862252950668335},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6715572476387024},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6203262805938721},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5920068025588989},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5728126168251038},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5464115142822266},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49519410729408264},{"id":"https://openalex.org/keywords/lottery-scheduling","display_name":"Lottery scheduling","score":0.4823814928531647},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4443695545196533},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.32242244482040405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21541422605514526},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13403400778770447},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08835825324058533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0748167634010315}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8009926080703735},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.7298858165740967},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7293739318847656},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6862252950668335},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6715572476387024},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6203262805938721},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5920068025588989},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5728126168251038},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5464115142822266},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49519410729408264},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.4823814928531647},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4443695545196533},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.32242244482040405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21541422605514526},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13403400778770447},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08835825324058533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0748167634010315}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rtcsa.1995.528743","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rtcsa.1995.528743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.1929","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umass.edu/pub/techrept/techreport/1995/UM-CS-1995-073.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.47999998927116394,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1507544503","https://openalex.org/W2005239962","https://openalex.org/W2098038177","https://openalex.org/W2157311434","https://openalex.org/W2166278583","https://openalex.org/W2166573642"],"related_works":["https://openalex.org/W2167574351","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W3184267879","https://openalex.org/W1935185185","https://openalex.org/W2225350526","https://openalex.org/W2557471897","https://openalex.org/W2978148977","https://openalex.org/W2359186131","https://openalex.org/W1526709096"],"abstract_inverted_index":{"Many":[0],"real-time":[1,19],"scheduling":[2,23,27,65,78],"algorithms":[3,24,30],"use":[4],"simplistic":[5],"sets":[6],"of":[7,61],"assumptions":[8],"and":[9,25,87],"this":[10,48,54,72],"limits":[11],"their":[12,44],"applicability":[13],"in":[14,53],"practice.":[15],"Often,":[16],"a":[17,50,81],"large":[18],"system":[20,39],"has":[21],"multiple":[22],"multi-level":[26,62,77],"algorithms.":[28],"Multiple":[29],"arise":[31],"when":[32],"it":[33],"is":[34,49],"possible":[35],"to":[36],"partition":[37],"the":[38,59],"into":[40],"subsystems,":[41],"each":[42],"with":[43],"own":[45],"algorithm.":[46],"While":[47],"valuable":[51],"approach,":[52],"paper":[55],"we":[56,75],"focus":[57],"on":[58],"issue":[60],"scheduling.":[63],"Multi-level":[64],"arises":[66],"for":[67],"various":[68],"important":[69],"reasons.":[70],"In":[71],"invited":[73],"presentation":[74],"discuss":[76],"examples":[79],"from":[80],"process/thread":[82],"model,":[83],"local/distributed":[84],"scheduling,":[85],"manufacturing,":[86],"multimedia.":[88]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}