{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726811,0.0005726581,0.0004688187,0.000633256,0.00050886,0.001007571,0.001167963,0.0003769055,0.001140188],"category_scores_gemma":[0.00678745,0.0003003411,0.0002061713,0.000650138,0.0004581083,0.0009769059,0.0006620036,0.0007656796,0.0002687594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008960458,"about_ca_system_score_gemma":0.0009362993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001177346,"about_ca_topic_score_gemma":0.001285126,"domain_scores_codex":[0.998584,0.0004064669,0.0001027925,0.0002084664,0.0005549924,0.0001432932],"domain_scores_gemma":[0.9971473,0.001414908,0.0003854892,0.0005418931,0.0003207296,0.000189724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001473195,0.0003471693,0.003113514,0.000236313,0.00006375073,0.0002284278,0.000362059,0.6120229,0.1132054,0.02857045,0.002772415,0.2376044],"study_design_scores_gemma":[0.00005602202,0.00008598636,0.0004585441,0.000007395065,0.00001459327,0.0000567834,0.00002541577,0.978667,0.01238291,0.005747281,0.002482282,0.00001577602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1313602,0.0008126728,0.8600195,0.0002601676,0.0001341308,0.000120158,0.00005287835,0.002339647,0.004900631],"genre_scores_gemma":[0.8251935,0.0002817435,0.1723227,0.00006672036,0.00007320463,0.00008505146,0.0000681905,0.0002724353,0.001636478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001726811,"threshold_uncertainty_score":0.009132326,"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."}}