{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009522203,0.0004335896,0.0006828809,0.0004304961,0.0004021673,0.001304507,0.001547826,0.0005370869,0.00104478],"category_scores_gemma":[0.002917458,0.0004837015,0.0005378536,0.0007208072,0.0005917394,0.001549984,0.0006232552,0.0008197583,0.0002768428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077052,"about_ca_system_score_gemma":0.001827502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003690273,"about_ca_topic_score_gemma":0.003180481,"domain_scores_codex":[0.9992879,0.0001678748,0.00005418328,0.0001031254,0.0002464424,0.0001403974],"domain_scores_gemma":[0.9990216,0.0003991294,0.0001479225,0.0001890292,0.0001515582,0.00009061336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000377926,0.0001685054,0.001088912,0.0002005596,0.00007129784,0.0002423933,0.0003091953,0.8126374,0.02797396,0.08840954,0.002170208,0.06635019],"study_design_scores_gemma":[0.00002527393,0.00004375027,0.00008284325,0.000005992115,0.00000879888,0.00003745043,0.00001759292,0.9788179,0.003219416,0.01662647,0.001105321,0.000009285408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08023485,0.0002613621,0.9161838,0.0001209849,0.0000660547,0.00005250042,0.00005724185,0.0006442497,0.002379055],"genre_scores_gemma":[0.7923769,0.0002668231,0.2046615,0.00007164585,0.00003707765,0.0001013976,0.0001187277,0.0001400636,0.002225791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003690273,"threshold_uncertainty_score":0.007814646,"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."}}