{"id":"W2169826316","doi":"10.1109/icess.2009.50","title":"On-Line and Off-Line DVS for Fixed Priority with Preemption Threshold Scheduling","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preemption; Dynamic voltage scaling; Computer science; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Earliest deadline first scheduling; Rate-monotonic scheduling; Dynamic priority scheduling; Fair-share scheduling; Power consumption; Energy consumption; Embedded system; Real-time computing; Parallel computing; Computer network; Power (physics); Operating system; Mathematical optimization; Engineering; Mathematics; Electrical engineering; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002516534,0.0001143966,0.0001280786,0.00007158889,0.000127029,0.0001154596,0.0002329853,0.00005242239,0.000001935833],"category_scores_gemma":[0.00003269812,0.00008650032,0.00002408764,0.0001544336,0.0000184259,0.0002089335,0.0000430255,0.00008289507,0.000001504937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001473295,"about_ca_system_score_gemma":0.0000295094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002563565,"about_ca_topic_score_gemma":0.000003044874,"domain_scores_codex":[0.999216,0.00001396864,0.0001509681,0.0003201542,0.0001340394,0.0001648844],"domain_scores_gemma":[0.9994288,0.00006351307,0.00006357758,0.0002823372,0.0001029084,0.00005884773],"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.0002730884,0.0005118011,0.0006746936,0.00004534417,0.00003142672,0.00000595911,0.0004077381,0.3540434,0.000590617,0.4058896,0.001721487,0.2358048],"study_design_scores_gemma":[0.0005147278,0.0009850332,0.0004738805,0.0000364491,0.000003466698,0.000005246538,0.000001779672,0.9824889,0.004306034,0.01089268,0.0001520315,0.000139812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03292362,0.00006813553,0.9637181,0.001457153,0.00003325268,0.0002804988,6.864334e-7,0.0005579842,0.0009606284],"genre_scores_gemma":[0.5116186,0.00001773436,0.4876175,0.0005195701,0.00003102302,0.000004586429,0.000002790689,0.000003065573,0.0001850902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6284454,"threshold_uncertainty_score":0.3527381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0291385746166586,"score_gpt":0.2919496921405179,"score_spread":0.2628111175238593,"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."}}