{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003963104,0.0001093957,0.0001185423,0.00005366248,0.0001204335,0.0001640399,0.0003572605,0.0000602241,0.000009910926],"category_scores_gemma":[0.00001477778,0.00008494602,0.00004402595,0.0001592832,0.00001765028,0.001087629,0.00007587083,0.00006667402,0.00008713942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000842823,"about_ca_system_score_gemma":0.00005847071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007802985,"about_ca_topic_score_gemma":0.0002167972,"domain_scores_codex":[0.9989809,0.00002079439,0.0001592226,0.0003420101,0.0002319368,0.0002651059],"domain_scores_gemma":[0.9992403,0.00004379296,0.00007892025,0.0004675023,0.00009777353,0.00007167866],"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.0001362755,0.0003922175,0.01375211,0.0002414886,0.0001143257,0.000007256836,0.002911897,0.02473118,0.0465585,0.7847484,0.01918265,0.1072237],"study_design_scores_gemma":[0.0008056912,0.0002175934,0.003808278,0.00004715687,0.000008866767,0.00003536621,0.0000315898,0.9685875,0.01791031,0.001000681,0.00725077,0.0002962224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03953574,0.00004545246,0.9497101,0.002415576,0.0001351616,0.0004396999,5.212884e-7,0.0002767175,0.007441064],"genre_scores_gemma":[0.650131,0.000001566655,0.3482622,0.00005907189,0.0001697904,0.00002858673,0.000001200872,0.000006061819,0.0013405],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9438563,"threshold_uncertainty_score":0.3463998,"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."}}