{"id":"https://openalex.org/W2462894048","doi":"https://doi.org/10.1109/sies.2016.7509434","title":"SS01 \u2014 Explicit per-task deadline scaling for uniprocessor scheduling of job-level static mixed-criticality systems","display_name":"SS01 \u2014 Explicit per-task deadline scaling for uniprocessor scheduling of job-level static mixed-criticality systems","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2462894048","doi":"https://doi.org/10.1109/sies.2016.7509434","mag":"2462894048"},"language":"en","primary_location":{"id":"doi:10.1109/sies.2016.7509434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2016.7509434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","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/A5042146726","display_name":"Dirk M\u00fcller","orcid":"https://orcid.org/0000-0002-6106-6607"},"institutions":[{"id":"https://openalex.org/I4210165059","display_name":"Hochschule f\u00fcr Technik und Wirtschaft Dresden \u2013 University of Applied Sciences","ror":"https://ror.org/05q5pk319","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210165059"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dirk Muller","raw_affiliation_strings":["Faculty of Informatics/Mathematics, University of Applied Sciences HTW Dresden, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics/Mathematics, University of Applied Sciences HTW Dresden, Dresden, Germany","institution_ids":["https://openalex.org/I4210165059"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042146726"],"corresponding_institution_ids":["https://openalex.org/I4210165059"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05925997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"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.9997000098228455,"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.9879999756813049,"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.9797999858856201,"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.7866150140762329},{"id":"https://openalex.org/keywords/mixed-criticality","display_name":"Mixed criticality","score":0.7099789381027222},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.6647413969039917},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6580089926719666},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.6479341983795166},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5868690013885498},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.47151291370391846},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.4302312731742859},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41280847787857056},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.40542322397232056},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3503371477127075},{"id":"https://openalex.org/keywords/criticality","display_name":"Criticality","score":0.3266730308532715},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.32443374395370483},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20864510536193848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12424728274345398},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10048475861549377},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09029510617256165},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.07539749145507812}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7866150140762329},{"id":"https://openalex.org/C2781124451","wikidata":"https://www.wikidata.org/wiki/Q6883956","display_name":"Mixed criticality","level":3,"score":0.7099789381027222},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.6647413969039917},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6580089926719666},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.6479341983795166},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5868690013885498},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47151291370391846},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.4302312731742859},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41280847787857056},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.40542322397232056},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3503371477127075},{"id":"https://openalex.org/C125611927","wikidata":"https://www.wikidata.org/wiki/Q17008131","display_name":"Criticality","level":2,"score":0.3266730308532715},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.32443374395370483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20864510536193848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12424728274345398},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10048475861549377},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09029510617256165},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.07539749145507812},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185544564","wikidata":"https://www.wikidata.org/wiki/Q81197","display_name":"Nuclear physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sies.2016.7509434","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sies.2016.7509434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 11th IEEE Symposium on Industrial Embedded Systems (SIES)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1923257997","https://openalex.org/W1977918654","https://openalex.org/W2005353733","https://openalex.org/W2034608968","https://openalex.org/W2064955339","https://openalex.org/W2076285066","https://openalex.org/W2081415839","https://openalex.org/W2109488193","https://openalex.org/W2120629818","https://openalex.org/W2137189977","https://openalex.org/W2146412113","https://openalex.org/W2169704840","https://openalex.org/W2211173788","https://openalex.org/W2216355539","https://openalex.org/W2293968540","https://openalex.org/W3100759067","https://openalex.org/W6684535045"],"related_works":["https://openalex.org/W56912691","https://openalex.org/W2110186189","https://openalex.org/W2172075652","https://openalex.org/W2605049164","https://openalex.org/W4316659495","https://openalex.org/W2017977262","https://openalex.org/W160191800","https://openalex.org/W103924539","https://openalex.org/W2001066483","https://openalex.org/W2462894048"],"abstract_inverted_index":{"Scheduling":[0],"for":[1,18,31],"mixed-criticality":[2],"(MC)":[3],"systems":[4],"needs":[5],"to":[6,15,25,61,102],"consider":[7],"priority":[8],"promotion":[9],"in":[10,13],"LO":[11],"mode":[12],"order":[14],"be":[16],"prepared":[17],"the":[19,34,93,96],"immediate":[20],"utilization":[21],"increase":[22],"when":[23],"switching":[24],"HI":[26],"mode.":[27],"An":[28],"established":[29,103],"method":[30],"that":[32],"is":[33,65],"use":[35],"of":[36,95],"virtual":[37],"deadlines.":[38],"The":[39],"EDF-VD":[40],"(Earliest":[41],"Deadline":[42],"First":[43],"with":[44,53,100],"Virtual":[45],"Deadlines)":[46],"algorithm":[47],"applies":[48],"a":[49,82],"uniform":[50],"deadline":[51,63,88,104],"scaling":[52,56,64,105],"only":[54],"one":[55],"factor":[57],"x.":[58],"A":[59],"generalization":[60],"nonuniform":[62],"attractive":[66],"since":[67],"this":[68],"relaxation":[69],"potentially":[70],"renders":[71],"corresponding":[72],"schedulability":[73,98],"tests":[74],"less":[75],"pessimistic":[76],"and":[77,85,91],"more":[78],"resource-efficient.":[79],"We":[80],"present":[81],"new,":[83],"general":[84],"explicit":[86],"per-task":[87],"scaling,":[89],"evaluate":[90],"discuss":[92],"properties":[94],"associated":[97],"test":[99],"respect":[101],"approaches.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}