{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007379636,0.0004658407,0.0005378003,0.0006849803,0.0005713282,0.001012776,0.001362772,0.0003282552,0.003399556],"category_scores_gemma":[0.002722034,0.000194431,0.0003299277,0.0007670428,0.000376665,0.0008093112,0.0006404421,0.0006078702,0.0004021418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009713207,"about_ca_system_score_gemma":0.001937869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003143895,"about_ca_topic_score_gemma":0.003596148,"domain_scores_codex":[0.9991967,0.0001999843,0.00005671552,0.0001062575,0.0002994125,0.0001408893],"domain_scores_gemma":[0.9988021,0.0003896327,0.0001156249,0.0002467936,0.0002875975,0.0001583486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001063459,0.0003245721,0.002612947,0.0002038459,0.00005187659,0.0002148874,0.0002014107,0.1795477,0.02292723,0.0411387,0.009255008,0.7424583],"study_design_scores_gemma":[0.0001169001,0.0002549737,0.0006287813,0.0000194453,0.000021928,0.0002626205,0.00006646839,0.9629065,0.01184733,0.01357955,0.01027715,0.0000183086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06870551,0.0009476695,0.9174234,0.0002912961,0.0002958179,0.000130332,0.000104247,0.001465791,0.01063593],"genre_scores_gemma":[0.7442192,0.0002674057,0.2499435,0.0001405331,0.0000839592,0.00007274522,0.0002052419,0.0001755567,0.004891801],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003399556,"threshold_uncertainty_score":0.01137263,"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."}}