{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527579,0.0009551916,0.0009861012,0.002078299,0.001480456,0.00302078,0.001964228,0.001820386,0.002280406],"category_scores_gemma":[0.003851477,0.0006352291,0.001094016,0.005333445,0.001023134,0.003638883,0.001001848,0.00216245,0.00189643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009926765,"about_ca_system_score_gemma":0.00170434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002598569,"about_ca_topic_score_gemma":0.001265192,"domain_scores_codex":[0.9985412,0.000309786,0.000251418,0.0002097665,0.0005553254,0.0001324662],"domain_scores_gemma":[0.9988936,0.0003626206,0.00007692674,0.0002459422,0.0003527312,0.00006830192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009884489,0.0001477497,0.001107882,0.00104789,0.00004582166,0.0002512632,0.0004497977,0.06016318,0.004474442,0.6382102,0.01771847,0.2762844],"study_design_scores_gemma":[0.00005980241,0.0001449066,0.000805854,0.0003076998,0.00003340077,0.0007606697,0.0002212707,0.2213006,0.002372774,0.5268307,0.2470818,0.00008053888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.006011646,0.0108646,0.9629441,0.001384494,0.0005114847,0.0004319529,0.0003679016,0.001266805,0.01621688],"genre_scores_gemma":[0.04181231,0.01729251,0.9326466,0.0004254133,0.0004220472,0.0006910139,0.0009633767,0.0002166202,0.005530129],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00302078,"threshold_uncertainty_score":0.008078694,"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."}}