{"id":"W1799546","doi":"10.1007/978-3-319-12436-0_19","title":"Fixed-Priority Scheduling Policies and Their Non-utilization Bounds","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Earliest deadline first scheduling; Rate-monotonic scheduling; Scheduling (production processes); Fair-share scheduling; Mathematical optimization; Deadline-monotonic scheduling; Distributed computing; Two-level scheduling; Monotonic function; Mathematics; Computer network; Quality of service","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00645033,0.002399282,0.002206075,0.002765383,0.001843137,0.005966063,0.00510935,0.002021193,0.007683981],"category_scores_gemma":[0.0348411,0.00159663,0.001181677,0.00457049,0.002510875,0.006860713,0.002907658,0.006708189,0.001544803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004654354,"about_ca_system_score_gemma":0.002737671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00261471,"about_ca_topic_score_gemma":0.001451092,"domain_scores_codex":[0.9950931,0.001246548,0.0002461925,0.0006355849,0.001807728,0.000970952],"domain_scores_gemma":[0.9709067,0.02297228,0.001301955,0.002227969,0.001839736,0.0007513095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003231774,0.0001520429,0.0003041172,0.0003097244,0.00006326754,0.0001099427,0.0002366616,0.09080692,0.001578178,0.8172039,0.006323763,0.08258824],"study_design_scores_gemma":[0.0000309039,0.00008006166,0.0003385835,0.0002101233,0.00005048006,0.000213158,0.00006476503,0.377102,0.001478261,0.6135481,0.006844061,0.00003951131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03504237,0.03046327,0.8490873,0.002134863,0.0009765214,0.0001228966,0.0003981951,0.0009871371,0.08078742],"genre_scores_gemma":[0.6976079,0.02210612,0.2494952,0.0009166737,0.001469847,0.0005378537,0.000561213,0.0009755754,0.0263296],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007683981,"threshold_uncertainty_score":0.03411299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02116351660104566,"score_gpt":0.2575855369553231,"score_spread":0.2364220203542775,"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."}}