{"id":"W2166532433","doi":"10.1109/rtcsa.2009.25","title":"Integrating Preemption Threshold to Fixed Priority DVS Scheduling Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Preemption; Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Algorithm; Embedded system; Real-time computing; Parallel computing; Operating system; Mathematical optimization; Mathematics; Engineering","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.0004140288,0.0001343393,0.0001377606,0.0001305397,0.0001654917,0.0002652815,0.0006590212,0.00006668225,0.000008035083],"category_scores_gemma":[0.00007699615,0.000118654,0.00005043051,0.0004708804,0.000008718979,0.0003936568,0.0001464916,0.0001573135,0.00003252555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004722736,"about_ca_system_score_gemma":0.00003871279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001791091,"about_ca_topic_score_gemma":0.000003390994,"domain_scores_codex":[0.9988596,0.00003473278,0.0002450614,0.0003889862,0.0002215266,0.0002501151],"domain_scores_gemma":[0.9992419,0.00003073413,0.00006224503,0.0004296982,0.000124344,0.0001111062],"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.00001316215,0.0002502214,0.001337306,0.00001205622,0.00001552663,0.00001185795,0.0023031,0.07470927,0.005585138,0.2592922,0.004219424,0.6522507],"study_design_scores_gemma":[0.0001080905,0.0001583341,0.001380321,0.00003739701,0.000001467018,0.000005555694,0.00001276409,0.9826363,0.0093044,0.005808828,0.0003467867,0.0001997323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008733504,0.00002871115,0.9789914,0.001657343,0.0001282897,0.0001932289,2.123234e-7,0.00143635,0.008830927],"genre_scores_gemma":[0.3634065,0.00000342141,0.6354138,0.0008901834,0.00005332323,0.000003532488,0.000001152439,0.000002989422,0.0002250172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.907927,"threshold_uncertainty_score":0.4838568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02146545021472751,"score_gpt":0.2912733675942191,"score_spread":0.2698079173794916,"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."}}