{"id":"W2130333921","doi":"10.1109/saso.2011.32","title":"Adaptive Scheduling and Overhead Tuning for Deadline Constrained Computations","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Dynamic priority scheduling; Computation; Implementation; Quality of service; Thread (computing); Grid; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Computer network; Operating system","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.0002349049,0.0001031489,0.0001411865,0.00005692146,0.0001671028,0.00010167,0.0002454532,0.00003928588,0.000005465851],"category_scores_gemma":[0.00003164557,0.00009459369,0.00003868789,0.0001474733,0.00004722844,0.0001373448,0.00008857004,0.0000570989,0.000007237522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001015509,"about_ca_system_score_gemma":0.00005244911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004717828,"about_ca_topic_score_gemma":0.000004526989,"domain_scores_codex":[0.9992243,0.00003024607,0.0001971646,0.0002608273,0.00008060902,0.0002068355],"domain_scores_gemma":[0.9993764,0.000194364,0.00007028109,0.0001561537,0.0001152563,0.00008756077],"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.00001371383,0.0000609362,0.0007015581,0.00003074283,0.00005289628,0.000006032939,0.00254243,0.003506278,0.0001623041,0.9803291,0.000289848,0.01230418],"study_design_scores_gemma":[0.0004728446,0.0001205221,0.0004549731,0.0000406521,0.000005310934,0.00002740557,0.0001667829,0.9909153,0.00005195714,0.007154048,0.0004469038,0.0001432846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009363423,0.00006731533,0.9838424,0.0001044614,0.0002540138,0.0001998824,0.000006370773,0.0001722356,0.005989857],"genre_scores_gemma":[0.608659,5.015427e-7,0.3911502,0.00007798465,0.00003057939,0.000005807677,0.000003668788,0.000003230074,0.00006900678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9874091,"threshold_uncertainty_score":0.3857419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07052720135940557,"score_gpt":0.2651427742708108,"score_spread":0.1946155729114053,"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."}}