{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007724077,0.0003299628,0.0004374539,0.000373333,0.0008766915,0.0004680925,0.001039503,0.0001966038,0.000002604495],"category_scores_gemma":[0.00006915147,0.0003361049,0.0001637999,0.0006701406,0.00008920486,0.0007160944,0.00004001009,0.0002627305,0.00001860858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001168007,"about_ca_system_score_gemma":0.0001408964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007348833,"about_ca_topic_score_gemma":0.00003003466,"domain_scores_codex":[0.997458,0.0002241387,0.0006639333,0.0007551661,0.0003435321,0.0005552524],"domain_scores_gemma":[0.9974024,0.0004733927,0.0002907979,0.001401481,0.0002264472,0.0002054271],"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.0003358883,0.0022116,0.003716241,0.003340006,0.001413717,0.00006636931,0.1230184,0.04463824,0.006905758,0.7559943,0.002460708,0.05589883],"study_design_scores_gemma":[0.002418664,0.0008006216,0.002692129,0.00104309,0.0001325659,0.0006171434,0.004129521,0.9650143,0.004710445,0.015491,0.00153763,0.001412839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03223883,0.0002320066,0.9627303,0.0002308563,0.001404087,0.0009365169,0.000008373535,0.000685711,0.001533294],"genre_scores_gemma":[0.8890749,0.00001673588,0.110303,0.0001123828,0.0001530028,0.00007139216,0.000004291155,0.00003658108,0.0002277708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9203761,"threshold_uncertainty_score":0.9999091,"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."}}