{"id":"W1554654249","doi":"10.1109/rtas.2005.49","title":"Solution Space for Fixed-Priority with Preemption Threshold","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Correctness; Computer science; Scheduling (production processes); Algorithm; Deadline-monotonic scheduling; Mathematical proof; Mathematical optimization; Mathematics; Dynamic priority scheduling; Rate-monotonic scheduling; 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.001535147,0.000717139,0.0007513705,0.0008162786,0.001114838,0.002521672,0.001290663,0.0009543015,0.009292226],"category_scores_gemma":[0.007816015,0.0004087517,0.000959261,0.001120544,0.001023725,0.00260713,0.001687767,0.001550981,0.0007429821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322564,"about_ca_system_score_gemma":0.002824138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003324756,"about_ca_topic_score_gemma":0.003900623,"domain_scores_codex":[0.998687,0.0003230731,0.00007192448,0.0003303166,0.0003492414,0.0002384776],"domain_scores_gemma":[0.9969796,0.002093707,0.0002193722,0.0002221554,0.0003596258,0.0001255894],"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.0004437952,0.000203394,0.0006704047,0.0007493598,0.00006298738,0.0002260646,0.0004244512,0.5298104,0.003605288,0.2740647,0.008386368,0.1813527],"study_design_scores_gemma":[0.0001364639,0.0001399008,0.0001788721,0.00006928699,0.0000294374,0.0001064035,0.0002314424,0.6716129,0.002860004,0.3173121,0.007298626,0.00002457301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04883476,0.0005461487,0.937054,0.001125072,0.00009761629,0.0001698646,0.0002938066,0.000855198,0.0110236],"genre_scores_gemma":[0.3382542,0.0005586504,0.652782,0.0002393776,0.00007792983,0.0002908471,0.0006942942,0.0002321641,0.006870468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009292226,"threshold_uncertainty_score":0.03108555,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01720642856049311,"score_gpt":0.2519211475280792,"score_spread":0.2347147189675861,"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."}}