{"id":"W4385485417","doi":"10.1109/isorc58943.2023.00013","title":"A Robust Scheduling Algorithm for Overload-Tolerant Real-Time Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Context switch; Uniprocessor system; Computer science; Multiprocessing; Workload; Scheduling (production processes); Least slack time scheduling; Earliest deadline first scheduling; Distributed computing; Schedule; Algorithm; Dynamic priority scheduling; Parallel computing; Multiprocessor scheduling; Rate-monotonic scheduling; Real-time computing; Embedded system; Mathematical optimization; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001732501,0.0003336283,0.0005538334,0.0003712489,0.0003179496,0.0008447767,0.001259553,0.000179298,0.00001854789],"category_scores_gemma":[0.0001162733,0.0002990525,0.0002251996,0.001312664,0.00003252325,0.0009590131,0.0003604133,0.0001455774,0.001597114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001261138,"about_ca_system_score_gemma":0.0001820768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006442906,"about_ca_topic_score_gemma":0.000004063324,"domain_scores_codex":[0.9966418,0.0001306211,0.0007288124,0.0009478288,0.0006283309,0.0009226322],"domain_scores_gemma":[0.9974717,0.0006542556,0.0002263662,0.001116471,0.000270379,0.0002607983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003338188,0.0002928911,0.0002931199,0.001064993,0.0006944202,0.000432863,0.003567486,0.6088174,0.06463087,0.1460557,0.03144818,0.1426687],"study_design_scores_gemma":[0.000580691,0.00007277318,0.00008310495,0.0001435285,0.00001126356,0.00005776388,0.00020448,0.9964107,0.0006552569,0.0002353017,0.001152434,0.0003927595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007410751,0.00009440867,0.9802889,0.0003319178,0.001585979,0.001130563,0.00001233574,0.002486051,0.006659127],"genre_scores_gemma":[0.04055712,0.0000456641,0.941732,0.00009183401,0.0009925987,0.000512997,0.00004143537,0.0001086956,0.01591758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3875932,"threshold_uncertainty_score":0.9999462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03607972710610283,"score_gpt":0.2571903736090667,"score_spread":0.2211106465029638,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}