{"id":"https://openalex.org/W6962747828","doi":"https://doi.org/10.17615/49az-qx70","title":"Scheduling Mixed-Criticality Real-Time Systems","display_name":"Scheduling Mixed-Criticality Real-Time Systems","publication_year":2019,"publication_date":"2019-08-12","ids":{"openalex":"https://openalex.org/W6962747828","doi":"https://doi.org/10.17615/49az-qx70"},"language":"en","primary_location":{"id":"pmh:oai:cdr.lib.unc.edu:uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","is_oa":true,"landing_page_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","pdf_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","source":{"id":"https://openalex.org/S4306401075","display_name":"Carolina Digital Repository (University of North Carolina at Chapel Hill)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114027177","host_organization_name":"University of North Carolina at Chapel Hill","host_organization_lineage":["https://openalex.org/I114027177"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li, Haohan","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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Li, Haohan","raw_affiliation_strings":["University of North Carolina at Chapel Hill"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina at Chapel Hill","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":0.2594,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65126789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9790999889373779,"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.9790999889373779,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.00570000009611249,"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.001500000013038516,"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/human-multitasking","display_name":"Human multitasking","score":0.6829000115394592},{"id":"https://openalex.org/keywords/criticality","display_name":"Criticality","score":0.680899977684021},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6121000051498413},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4959999918937683},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4602000117301941},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43779999017715454},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.42419999837875366},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4097999930381775},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.39890000224113464}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7585999965667725},{"id":"https://openalex.org/C107418235","wikidata":"https://www.wikidata.org/wiki/Q1520565","display_name":"Human multitasking","level":2,"score":0.6829000115394592},{"id":"https://openalex.org/C125611927","wikidata":"https://www.wikidata.org/wiki/Q17008131","display_name":"Criticality","level":2,"score":0.680899977684021},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6121000051498413},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5879999995231628},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4959999918937683},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4602000117301941},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43779999017715454},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.42419999837875366},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4097999930381775},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.39890000224113464},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.38600000739097595},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.37369999289512634},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3555999994277954},{"id":"https://openalex.org/C2781124451","wikidata":"https://www.wikidata.org/wiki/Q6883956","display_name":"Mixed criticality","level":3,"score":0.35350000858306885},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.335999995470047},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C154556556","wikidata":"https://www.wikidata.org/wiki/Q192969","display_name":"Computer multitasking","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2793999910354614},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.273499995470047},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27219998836517334}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:cdr.lib.unc.edu:uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","is_oa":true,"landing_page_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","pdf_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","source":{"id":"https://openalex.org/S4306401075","display_name":"Carolina Digital Repository (University of North Carolina at Chapel Hill)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114027177","host_organization_name":"University of North Carolina at Chapel Hill","host_organization_lineage":["https://openalex.org/I114027177"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.17615/49az-qx70","is_oa":true,"landing_page_url":"https://doi.org/10.17615/49az-qx70","pdf_url":null,"source":{"id":"https://openalex.org/S7407051488","display_name":"UNC Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:cdr.lib.unc.edu:uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","is_oa":true,"landing_page_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","pdf_url":"https://cdr.lib.unc.edu/record/uuid:6980c995-cdf0-4858-8d9d-87993bc6fe68","source":{"id":"https://openalex.org/S4306401075","display_name":"Carolina Digital Repository (University of North Carolina at Chapel Hill)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114027177","host_organization_name":"University of North Carolina at Chapel Hill","host_organization_lineage":["https://openalex.org/I114027177"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6962747828.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,93],"dissertation":[1,94],"addresses":[2],"the":[3,7,51,67,90,102,183,197,200],"following":[4],"question":[5,99],"to":[6,35,56,73,96,118,123,131,141,180,196],"design":[8],"of":[9,63,80,126,134,158,185,204],"scheduling":[10,116,137],"policies":[11],"and":[12,65,113,174],"resource":[13,187,202],"allocation":[14],"mechanisms":[15],"in":[16,27],"contemporary":[17],"embedded":[18],"systems":[19],"that":[20,49],"are":[21,54,70,139,178,208],"implemented":[22],"on":[23,101],"integrated":[24],"computing":[25],"platforms:":[26],"a":[28,37,60,77,115],"multitasking":[29],"system":[30,105],"where":[31],"it":[32],"is":[33,85,148,164],"hard":[34],"estimate":[36],"task's":[38],"worst-case":[39,110],"execution":[40,111],"time,":[41,64],"how":[42],"do":[43],"we":[44],"assign":[45],"task":[46,84],"priorities":[47],"so":[48],"1)":[50],"safety-critical":[52],"tasks":[53,69,128,153,168],"asserted":[55],"be":[57,74],"completed":[58,75],"within":[59,76,189],"specified":[61],"length":[62,79],"2)":[66],"non-critical":[68],"also":[71,209],"guaranteed":[72],"predictable":[78],"time":[81,88],"if":[82],"no":[83],"actually":[86],"consuming":[87],"at":[89,150,166],"worst":[91],"case?":[92],"tries":[95],"answer":[97],"this":[98,143],"based":[100],"mixed-criticality":[103],"real-time":[104],"model,":[106],"which":[107],"defines":[108],"multiple":[109],"scenarios,":[112],"demands":[114],"policy":[117],"provide":[119],"provable":[120],"timing":[121],"guarantees":[122],"each":[124,132],"level":[125],"critical":[127],"with":[129,154,169],"respect":[130],"type":[133],"scenario.":[135],"Two":[136],"algorithms":[138,177],"proposed":[140],"serve":[142],"model.":[144],"The":[145,161],"OCBP":[146],"algorithm":[147,163],"aimed":[149,165],"discrete":[151],"one-shot":[152],"an":[155],"arbitrary":[156],"number":[157],"criticality":[159,171,191,206],"levels.":[160,192],"EDF-VD":[162],"recurrent":[167],"two":[170,190],"levels":[172,207],"(safety-critical":[173],"non-critical).":[175],"Both":[176],"proved":[179],"optimally":[181],"minimize":[182],"percentage":[184],"computational":[186,201],"waste":[188],"More":[193],"in-depth":[194],"investigations":[195],"relationship":[198],"among":[199],"requirement":[203],"different":[205],"provided":[210],"for":[211],"both":[212],"algorithms.":[213]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}