{"id":"W2169142010","doi":"10.1109/rtcsa.1999.811269","title":"Scheduling fixed-priority tasks with preemption threshold","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":270,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Preemption; Computer science; Fixed-priority pre-emptive scheduling; Deadline-monotonic scheduling; Rate-monotonic scheduling; Dynamic priority scheduling; Earliest deadline first scheduling; Fair-share scheduling; Scheduling (production processes); Distributed computing; Two-level scheduling; Context switch; Real-time computing; Mathematical optimization; Embedded system; Operating system; Mathematics; Schedule","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.0007206073,0.0001905672,0.0002017802,0.00009439953,0.0001644194,0.0003499737,0.0005806289,0.00009306844,0.00005049543],"category_scores_gemma":[0.00005411572,0.0001469942,0.00005465147,0.0004518734,0.00003382031,0.001121592,0.00009397702,0.0002008936,0.0002271387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000631581,"about_ca_system_score_gemma":0.0001359134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007688688,"about_ca_topic_score_gemma":0.00003648666,"domain_scores_codex":[0.9982563,0.00009255048,0.000272475,0.0005462104,0.0004383958,0.0003941056],"domain_scores_gemma":[0.9986833,0.00005722147,0.0001097783,0.0008865115,0.0001164815,0.0001466868],"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.00001660614,0.0001856335,0.05501245,0.0001021021,0.00008883312,0.00007252059,0.001184445,0.01488084,0.01213836,0.90991,0.0003773018,0.006030935],"study_design_scores_gemma":[0.005351933,0.001111568,0.02849321,0.0006911916,0.00007742247,0.001268122,0.0009849018,0.7670233,0.1598952,0.02132427,0.01010751,0.003671405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1942072,0.00009549643,0.7547447,0.0001554822,0.000260688,0.0002468661,2.180426e-7,0.0003566007,0.04993274],"genre_scores_gemma":[0.714317,0.000002894973,0.2849805,0.00007961786,0.00004413137,0.00001311911,6.173302e-7,0.00001077368,0.0005512807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8885857,"threshold_uncertainty_score":0.5994248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01626772737875741,"score_gpt":0.2411538590225183,"score_spread":0.2248861316437608,"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."}}