{"id":"https://openalex.org/W2810740386","doi":"https://doi.org/10.4230/lites-v005-i001-a001","title":"Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions","display_name":"Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2810740386","doi":"https://doi.org/10.4230/lites-v005-i001-a001","mag":"2810740386"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19272","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v005-i001-a001","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v005-i001-a001","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051071974","display_name":"Bader Alahmad","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Alahmad, Bader Naim","raw_affiliation_strings":["The University of British Columbia, 2366 Main Mall, Vancouver, BC, Canada V6T 1Z4","The University of British Columbia#R##N#2366 Main Mall, Vancouver, BC, Canada V6T 1Z4"],"affiliations":[{"raw_affiliation_string":"The University of British Columbia, 2366 Main Mall, Vancouver, BC, Canada V6T 1Z4","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"The University of British Columbia#R##N#2366 Main Mall, Vancouver, BC, Canada V6T 1Z4","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103175261","display_name":"Sathish Gopalakrishnan","orcid":"https://orcid.org/0000-0003-2959-4802"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Gopalakrishnan, Sathish","raw_affiliation_strings":["The University of British Columbia, 2332 Main Mall, Vancouver, BC, Canada V6T 1Z4","The University of British Columbia#R##N#2332 Main Mall, Vancouver, BC, Canada V6T 1Z4"],"affiliations":[{"raw_affiliation_string":"The University of British Columbia, 2332 Main Mall, Vancouver, BC, Canada V6T 1Z4","institution_ids":["https://openalex.org/I141945490"]},{"raw_affiliation_string":"The University of British Columbia#R##N#2332 Main Mall, Vancouver, BC, Canada V6T 1Z4","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051071974"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":1.0099,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7424835,"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":null,"last_page":null},"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.9944000244140625,"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/T12288","display_name":"Optimization and Search Problems","score":0.9929999709129333,"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/criticality","display_name":"Criticality","score":0.7963931560516357},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7756283283233643},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.7511178255081177},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7228236198425293},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6477544903755188},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.42963290214538574},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41013437509536743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35167670249938965},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11646690964698792},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11492851376533508},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0978139340877533}],"concepts":[{"id":"https://openalex.org/C125611927","wikidata":"https://www.wikidata.org/wiki/Q17008131","display_name":"Criticality","level":2,"score":0.7963931560516357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7756283283233643},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7511178255081177},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7228236198425293},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6477544903755188},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.42963290214538574},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41013437509536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35167670249938965},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11646690964698792},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11492851376533508},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0978139340877533},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C185544564","wikidata":"https://www.wikidata.org/wiki/Q81197","display_name":"Nuclear physics","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:19272","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v005-i001-a001","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:ojs.dagstuhl.de:article/78","is_oa":true,"landing_page_url":"https://ojs.dagstuhl.de/index.php/lites/article/view/LITES-v005-i001-a001","pdf_url":"https://ojs.dagstuhl.de/index.php/lites/article/view/LITES-v005-i001-a001","source":{"id":"https://openalex.org/S4306401231","display_name":"Leibniz Transactions on Embedded Systems (Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz Transactions on Embedded Systems; Vol 5, No 1 (2018); 01:1-01:30","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:fa03aae17b36480b831bdaef24f414ba","is_oa":true,"landing_page_url":"https://doaj.org/article/fa03aae17b36480b831bdaef24f414ba","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz Transactions on Embedded Systems, Vol 5, Iss 1, Pp 01:1-01:30 (2018)","raw_type":"article"},{"id":"doi:10.4230/lites-v005-i001-a001","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lites-v005-i001-a001","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:19272","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LITES-v005-i001-a001","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1498636830","https://openalex.org/W1518931405","https://openalex.org/W1912524746","https://openalex.org/W1964869575","https://openalex.org/W1972868674","https://openalex.org/W1991659074","https://openalex.org/W1995985801","https://openalex.org/W1997477668","https://openalex.org/W2005890553","https://openalex.org/W2009253638","https://openalex.org/W2027579135","https://openalex.org/W2032419970","https://openalex.org/W2042979415","https://openalex.org/W2073280806","https://openalex.org/W2096840168","https://openalex.org/W2110338773","https://openalex.org/W2119567691","https://openalex.org/W2141440050","https://openalex.org/W2145856894","https://openalex.org/W2146412113","https://openalex.org/W2146771148","https://openalex.org/W2154174364","https://openalex.org/W2165201363","https://openalex.org/W2169394026","https://openalex.org/W2169704840","https://openalex.org/W2286839858","https://openalex.org/W2300091980","https://openalex.org/W3106238320"],"related_works":["https://openalex.org/W1949268006","https://openalex.org/W2313709792","https://openalex.org/W2158430805","https://openalex.org/W3118350401","https://openalex.org/W2031621633","https://openalex.org/W2919879667","https://openalex.org/W2554466536","https://openalex.org/W2201888866","https://openalex.org/W112293970","https://openalex.org/W3133000054","https://openalex.org/W2024096351","https://openalex.org/W1767846093","https://openalex.org/W1998373563","https://openalex.org/W21387639","https://openalex.org/W2004356947","https://openalex.org/W1105024888","https://openalex.org/W2412328123","https://openalex.org/W2564447440","https://openalex.org/W3083844065","https://openalex.org/W2807526367"],"abstract_inverted_index":{"We":[0,162,264,296,307],"pose":[1],"the":[2,49,63,79,106,133,137,143,155,180,195,205,213,219,228,236,242,261,266],"problem":[3,267],"of":[4,65,68,100,108,159,176,197,215],"scheduling":[5,50,95,129,257,293,327],"Mixed":[6],"Criticality":[7,25],"(MC)":[8],"job":[9,26,34,232],"systems":[10],"when":[11,33],"there":[12],"are":[13,36,41,192,210],"only":[14],"two":[15],"criticality":[16,82,110],"levels,":[17],"Lo":[18,183],"and":[19,38,71,87,116,140,184,207,218,250,280,285],"Hi":[20,69,101,109,185],"-referred":[21],"to":[22,59,126,226,234,251,318],"as":[23,53,57,76,78,268],"Dual":[24],"systems-":[27],"on":[28,179,313],"a":[29,148,164,253,269,276,281,303],"single":[30],"processing":[31],"platform,":[32],"demands":[35],"probabilistic":[37,149,165,315],"their":[39,188],"distributions":[40,233],"known.":[42],"The":[43,90,190],"current":[44,325],"MC":[45,160,168,316,326],"models":[46],"require":[47],"that":[48,131,151,182,259,287,320],"policy":[51,258,294,300],"allocate":[52],"little":[54],"execution":[55,66,80,216],"time":[56],"possible":[58],"Lo-criticality":[60,73,96],"jobs":[61,74,97,186],"if":[62],"scenario":[64],"is":[67,88,125,145,152,172,225,245],"criticality,":[70],"drop":[72],"entirely":[75],"soon":[77],"scenario's":[81],"level":[83],"can":[84],"be":[85],"inferred":[86],"Hi.":[89],"work":[91,115],"incurred":[92],"by":[93,203,231,301],"\"incorrectly\"":[94],"in":[98,147,174,248],"cases":[99],"realized":[102],"scenarios":[103,217],"might":[104],"affect":[105],"feasibility":[107,171],"jobs;":[111],"we":[112],"quantify":[113],"this":[114],"call":[117],"it":[118],"Work":[119],"Threatening":[120],"Feasibility":[121],"(WTF).":[122],"Our":[123,223],"objective":[124],"construct":[127],"online":[128],"policies":[130],"minimize":[132],"expected":[134,238],"WTF":[135,239],"for":[136,167],"given":[138,220,243],"instance,":[139],"under":[141],"which":[142,241],"instance":[144,244],"feasible":[146,247],"sense":[150],"consistent":[153],"with":[154],"traditional":[156],"deterministic":[157],"definition":[158],"feasibility.":[161],"develop":[163],"framework":[166],"scheduling,":[169],"where":[170],"defined":[173],"terms":[175],"(chance)":[177],"constraints":[178],"probabilities":[181,191],"meet":[187],"deadlines.":[189],"computed":[193],"over":[194,275],"set":[196,214],"sample":[198],"paths,":[199],"or":[200],"trajectories,":[201],"induced":[202],"executing":[204],"policy,":[206],"those":[208],"paths":[209],"dependent":[211],"upon":[212],"demand":[221],"distributions.":[222],"goal":[224],"exploit":[227],"information":[229],"provided":[230],"compute":[235,252],"minimum":[237],"below":[240],"not":[246],"probability,":[249],"(randomized)":[254],"\"efficiently":[255],"implementable\"":[256],"realizes":[260],"latter":[262],"quantity.":[263],"model":[265],"Constrained":[270],"Markov":[271,291],"Decision":[272],"Process":[273],"(CMDP)":[274],"suitable":[277],"state":[278],"space":[279],"finite":[282],"planning":[283],"horizon,":[284],"show":[286],"an":[288,298],"optimal":[289,299],"(non-stationary)":[290],"randomized":[292],"exists.":[295],"derive":[297],"solving":[302],"Linear":[304],"Program":[305],"(LP).":[306],"also":[308],"carry":[309],"out":[310],"quantitative":[311],"evaluations":[312],"select":[314],"instances":[317],"demonstrate":[319],"our":[321],"approach":[322],"potentially":[323],"outperforms":[324],"policies.":[328]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}