{"id":"W2789401778","doi":"10.1016/j.automatica.2017.12.010","title":"Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems","year":2018,"lang":"en","type":"article","venue":"Automatica","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Science and Technology Development Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Modular design; Automaton; Computer science; Scheduling (production processes); Preemption; Distributed computing; Real-time operating system; Real-time computing; Fixed-priority pre-emptive scheduling; Supervisory control theory; Dynamic priority scheduling; Rate-monotonic scheduling; Supervisory control; Theoretical computer science; Embedded system; Control (management); Programming language; Mathematics; Mathematical optimization; Schedule; Operating system; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001288169,0.0002889728,0.0006368565,0.0002670557,0.0001980794,0.0002187306,0.00206177,0.0001702785,0.00007866331],"category_scores_gemma":[0.0004053524,0.000279494,0.0001421599,0.0006495757,0.0002834163,0.0009411855,0.0005457758,0.0001600388,0.000959725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000120129,"about_ca_system_score_gemma":0.0002936071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002503658,"about_ca_topic_score_gemma":0.000002673054,"domain_scores_codex":[0.9967564,0.0002762472,0.0009300938,0.0006231667,0.0009143078,0.0004997404],"domain_scores_gemma":[0.9962429,0.0003675136,0.0005981133,0.002063273,0.000521641,0.0002065286],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003327633,0.0004958068,0.001715352,0.001239719,0.0007631243,0.0001675389,0.007825472,0.003486293,0.1675117,0.8109354,0.003783607,0.002042714],"study_design_scores_gemma":[0.0007457273,0.000270669,0.007624478,0.0006512954,0.00003878899,0.0001232319,0.0001383234,0.9731444,0.005346205,0.01133519,0.0001419754,0.0004397537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6826549,0.0001773498,0.2898851,0.0004056803,0.0009827607,0.0009961694,0.00002841871,0.001077984,0.02379162],"genre_scores_gemma":[0.7961576,0.000004779318,0.2031912,0.00002427115,0.0002716838,0.00003155338,0.000008588953,0.00002761986,0.0002827024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9696581,"threshold_uncertainty_score":0.9999657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01023137148179439,"score_gpt":0.2439742486604671,"score_spread":0.2337428771786727,"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."}}