{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00376855,0.0004973466,0.001090374,0.0004046354,0.00044844,0.000540087,0.001103155,0.0002130642,7.090088e-7],"category_scores_gemma":[0.0001860235,0.0004604747,0.0002217297,0.0009753243,0.0001040546,0.0004777228,0.0003452289,0.0006016714,0.000002871002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002912302,"about_ca_system_score_gemma":0.0001841358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006785812,"about_ca_topic_score_gemma":0.000003390144,"domain_scores_codex":[0.9950495,0.0002045038,0.002308379,0.0005988167,0.0006514078,0.001187366],"domain_scores_gemma":[0.9958692,0.00103789,0.001643329,0.0003893452,0.0006486622,0.0004116137],"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.00008058799,0.0001980919,0.003959384,0.000249464,0.000137614,0.0002636209,0.0006246172,0.9494122,0.000081801,0.001399405,0.0001806912,0.04341248],"study_design_scores_gemma":[0.003100118,0.0004922814,0.006712424,0.0007673897,0.00003507105,0.001230538,0.0003783997,0.9856984,0.00004950679,0.0003205758,0.0007042509,0.000511017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3785735,0.0008477124,0.6190721,0.00009700183,0.0009483389,0.0003026339,0.00007489431,0.00007690564,0.000006829184],"genre_scores_gemma":[0.8699252,0.00002702085,0.1293434,0.00006706779,0.0004924811,0.000002400605,0.0001133708,0.00002447177,0.000004607733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4913516,"threshold_uncertainty_score":0.9997847,"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."}}