{"id":"W2013705016","doi":"10.1145/1952522.1952524","title":"Nonutilization bounds and feasible regions for arbitrary fixed-priority policies","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Office of Naval Research; Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Earliest deadline first scheduling; Dynamic priority scheduling; Bounding overwatch; Scheduling (production processes); Rate-monotonic scheduling; Deadline-monotonic scheduling; Bounded function; Mathematical optimization; Job shop scheduling; Distributed computing; Mathematics; Schedule; Computer network; Quality of service","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.005507161,0.001466983,0.0009580512,0.002071771,0.0007799459,0.00355337,0.00186585,0.000848751,0.002590661],"category_scores_gemma":[0.04263899,0.0006028633,0.001218729,0.00175333,0.002308054,0.004067871,0.001878488,0.002619233,0.0004017689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003027524,"about_ca_system_score_gemma":0.00237334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002469824,"about_ca_topic_score_gemma":0.001212367,"domain_scores_codex":[0.9940122,0.002188658,0.0004142175,0.0008897948,0.001748582,0.000746505],"domain_scores_gemma":[0.9630533,0.0270416,0.004484178,0.002297522,0.002449974,0.0006734377],"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.0001928372,0.0001004773,0.001984068,0.000296286,0.00006141181,0.000236878,0.0005110606,0.273701,0.005634758,0.6738578,0.00129392,0.04212947],"study_design_scores_gemma":[0.00002731677,0.0001423743,0.001390707,0.0001431343,0.00002672039,0.0001940039,0.0001660906,0.5981801,0.006554933,0.3879542,0.005172335,0.00004805072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04634009,0.001354923,0.9391219,0.0004977438,0.00005232825,0.00008944001,0.0002246577,0.0002934919,0.01202541],"genre_scores_gemma":[0.7704884,0.001432058,0.2248506,0.0001287579,0.0001214638,0.0003975375,0.0004290575,0.0002197753,0.001932536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005507161,"threshold_uncertainty_score":0.02912498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06013182717330944,"score_gpt":0.284343162704553,"score_spread":0.2242113355312435,"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."}}