{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001821271,0.0007193182,0.0007951518,0.0009468511,0.0005335718,0.001745639,0.002895858,0.0004753038,0.000005288694],"category_scores_gemma":[0.0001887668,0.0006166403,0.0001339242,0.0007089414,0.0008118997,0.0009063396,0.00186811,0.0008318496,0.00003188663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002753642,"about_ca_system_score_gemma":0.0005470603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001168522,"about_ca_topic_score_gemma":0.0001018391,"domain_scores_codex":[0.9957525,0.00007270091,0.0007168296,0.001808095,0.000826658,0.0008231878],"domain_scores_gemma":[0.996603,0.0006132539,0.0004597582,0.001723321,0.0003386601,0.0002619766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006253078,0.00002546916,0.0008755331,0.0002610066,0.00003252357,0.000027632,0.00552613,0.05048202,0.001664217,0.06610239,0.00001385814,0.874983],"study_design_scores_gemma":[0.0002521846,0.0001286675,0.0006535667,0.0007333452,0.000006630733,0.0001016568,0.000001212316,0.9431983,0.002236414,0.05068158,0.001191351,0.0008151125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001933474,0.0006895468,0.9912138,0.0005142022,0.001739115,0.0004405311,0.000002696142,0.0002278631,0.003238754],"genre_scores_gemma":[0.6559134,0.0000732614,0.3420389,0.000757819,0.0008622902,0.000008510083,0.000004776508,0.00005115123,0.0002898898],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8927162,"threshold_uncertainty_score":0.9996285,"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."}}