{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095708,0.0004524625,0.0003901634,0.0003986645,0.0005252273,0.0005730877,0.0008804171,0.0002174124,0.002274436],"category_scores_gemma":[0.002877062,0.0002930687,0.0002831724,0.0002904639,0.0004514488,0.000549907,0.0006021076,0.0006349846,0.0002660166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005284245,"about_ca_system_score_gemma":0.001616149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001972981,"about_ca_topic_score_gemma":0.002973459,"domain_scores_codex":[0.9995574,0.00009317698,0.0000240217,0.00005982967,0.0001214921,0.0001439125],"domain_scores_gemma":[0.9985877,0.0005178808,0.0001982235,0.000202747,0.0002918182,0.0002016529],"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.002766684,0.0003743648,0.002960885,0.0003634576,0.00007785879,0.0004344803,0.0005027721,0.6238936,0.113454,0.0839949,0.004078702,0.1670982],"study_design_scores_gemma":[0.00009897607,0.0002401372,0.0008081756,0.00001141328,0.000028392,0.00005936835,0.00002162575,0.9682311,0.01238321,0.01694741,0.001152709,0.0000173863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4349648,0.0002762566,0.5583389,0.000179533,0.0001134972,0.00006056666,0.0001036082,0.001359412,0.004603402],"genre_scores_gemma":[0.9687983,0.00004758586,0.02972408,0.000027295,0.00002558188,0.00002435162,0.00007737608,0.00007270023,0.001202605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002274436,"threshold_uncertainty_score":0.007608712,"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."}}