{"id":"W2107463456","doi":"10.1109/cec.2006.1688723","title":"An Efficient Genetic Algorithm for Task Scheduling in Heterogeneous Distributed Computing Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fair-share scheduling; Distributed computing; Scheduling (production processes); Dynamic priority scheduling; Two-level scheduling; Rate-monotonic scheduling; Parallel computing; Fixed-priority pre-emptive scheduling; Speedup; Symmetric multiprocessor system; Schedule; Mathematical optimization; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005805959,0.0002729934,0.0003723127,0.0001552858,0.0002141745,0.0005903457,0.00101069,0.000115621,8.921211e-7],"category_scores_gemma":[0.00001215369,0.0002615048,0.0001058954,0.000563467,0.00002826489,0.0001018693,0.000137191,0.0001178878,0.00001555651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001427095,"about_ca_system_score_gemma":0.00006705227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006319496,"about_ca_topic_score_gemma":0.00001498483,"domain_scores_codex":[0.9973271,0.0001571356,0.000727455,0.0007475892,0.0003188099,0.0007218954],"domain_scores_gemma":[0.9987326,0.0001617134,0.0001915258,0.000627546,0.0001537551,0.0001328382],"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.0000017285,0.0001597386,0.0005040774,0.00002982451,0.000008088758,0.00002924919,0.00006154612,0.9893185,0.0001161346,0.002635374,0.00008646588,0.007049203],"study_design_scores_gemma":[0.0006743884,0.000106968,0.001154545,0.00006894914,0.000004460493,0.00009290582,0.00002710655,0.9965909,0.00009274674,0.0001319466,0.0007161443,0.0003389117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1293938,0.0003782315,0.8682575,0.0000322776,0.0008074285,0.000579947,0.0000542265,0.0004129684,0.00008365287],"genre_scores_gemma":[0.8368565,4.356073e-7,0.1626572,0.00002960644,0.0002732654,0.00002278589,0.000124363,0.00001646588,0.00001932932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7074627,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0099877368913696,"score_gpt":0.2411575414989074,"score_spread":0.2311698046075378,"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."}}