{"id":"W2150687976","doi":"10.1142/s0129626407003149","title":"A TAXONOMY OF TASK SCHEDULING ALGORITHMS IN THE GRID","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Fair-share scheduling; Scheduling (production processes); Two-level scheduling; Grid; Grid computing; Dynamic priority scheduling; Architecture; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Algorithm; Mathematical optimization; Mathematics; Computer network; Quality of service","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.001897104,0.0001775951,0.0002351263,0.000163166,0.0001361553,0.0002004942,0.001434009,0.00005721499,9.992638e-7],"category_scores_gemma":[0.00003764818,0.0001347602,0.00007672874,0.000816253,0.00008357785,0.0003302027,0.0001049548,0.0002599501,0.00001289478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003658521,"about_ca_system_score_gemma":0.00006563405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006855611,"about_ca_topic_score_gemma":0.000006158907,"domain_scores_codex":[0.9981352,0.00009974449,0.0005166649,0.0003677035,0.0003949636,0.0004857045],"domain_scores_gemma":[0.9990339,0.0001761316,0.0002690871,0.0004115432,0.00005559758,0.00005376862],"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.0001778164,0.00144195,0.05940817,0.001835763,0.0002011405,0.001108129,0.04839164,0.3500284,0.01920051,0.01730489,0.01767832,0.4832233],"study_design_scores_gemma":[0.004328668,0.0002539755,0.04651311,0.001544711,0.00004370943,0.0005015864,0.001962326,0.846507,0.001041296,0.001507128,0.09367541,0.002121065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05000691,0.0004232726,0.9459471,0.001964753,0.0002837059,0.0002374659,0.000001225961,0.0000836652,0.001051907],"genre_scores_gemma":[0.8901123,0.000001678391,0.1081724,0.001467778,0.0002048388,0.00002005305,0.000004845927,0.000007688416,0.0000083953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8401055,"threshold_uncertainty_score":0.549536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0292541471935389,"score_gpt":0.2572351209769245,"score_spread":0.2279809737833856,"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."}}