{"id":"W2095930915","doi":"10.1016/j.jpdc.2007.05.015","title":"A high performance algorithm for static task scheduling in heterogeneous distributed computing systems","year":2007,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":235,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Algorithm; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Distributed computing; Parallel computing; Speedup; Symmetric multiprocessor system; Critical path method; Two-level scheduling; Fixed-priority pre-emptive scheduling; Round-robin scheduling; Schedule; Mathematical optimization","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.001878658,0.000965484,0.001150278,0.001220672,0.001707689,0.001431796,0.002599506,0.001212482,0.004216323],"category_scores_gemma":[0.00432393,0.0007284734,0.0006083153,0.001444831,0.0009178931,0.00168875,0.00182275,0.00131053,0.001000686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277654,"about_ca_system_score_gemma":0.002534362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006769767,"about_ca_topic_score_gemma":0.006568919,"domain_scores_codex":[0.999268,0.0001783859,0.00004636292,0.0001124789,0.0002822864,0.000112508],"domain_scores_gemma":[0.9986822,0.0006255645,0.00007722864,0.0001705749,0.0003368672,0.0001074169],"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.0008203531,0.0002553946,0.0009834826,0.0001738922,0.00009315098,0.0001458808,0.0001681087,0.6083156,0.00908876,0.01927683,0.007778596,0.3529001],"study_design_scores_gemma":[0.00007279497,0.00003818291,0.0000803766,0.000003522981,0.00001064025,0.00001739453,0.00001235735,0.9938865,0.0009601746,0.003985331,0.0009258016,0.000006850207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01726478,0.0002579395,0.9781535,0.0001842217,0.0001556456,0.0001019982,0.0000425673,0.001779907,0.002059457],"genre_scores_gemma":[0.1726642,0.0001557111,0.8231956,0.0001144617,0.00009515615,0.0002504877,0.0002066898,0.0003511883,0.002966621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006769767,"threshold_uncertainty_score":0.01410496,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01504554752251884,"score_gpt":0.2554308832610148,"score_spread":0.240385335738496,"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."}}