{"id":"W2129632267","doi":"10.1109/icpads.2006.40","title":"Efficient compile-time task scheduling for heterogeneous distributed computing systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Fair-share scheduling; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Two-level scheduling; Distributed computing; Earliest deadline first scheduling; Round-robin scheduling; Scheduling (production processes); Parallel computing; Deadline-monotonic scheduling; Schedule; Mathematical optimization; Operating system; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008358916,0.000486905,0.000439173,0.0006494085,0.0006600265,0.0007485396,0.0006861423,0.0002304887,0.0009655548],"category_scores_gemma":[0.002356903,0.0002644992,0.000265884,0.0008185222,0.0003161417,0.0006357439,0.0004320588,0.0004939119,0.000504254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006290652,"about_ca_system_score_gemma":0.001275633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002695476,"about_ca_topic_score_gemma":0.003365907,"domain_scores_codex":[0.9995047,0.0001409369,0.00003593549,0.00006388635,0.0001709125,0.00008369079],"domain_scores_gemma":[0.9990929,0.0003016671,0.0001127382,0.0002320834,0.0001916063,0.0000688976],"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.0006790414,0.0001702432,0.00237789,0.0002817461,0.00008974744,0.0002373842,0.00014515,0.6115735,0.04724727,0.01543031,0.009968007,0.3117997],"study_design_scores_gemma":[0.00008840906,0.00008815002,0.000812294,0.00001082688,0.00003207205,0.00004334361,0.00002888728,0.9688056,0.01780014,0.005893893,0.006383264,0.00001315201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1326026,0.001770098,0.8512694,0.0002460869,0.0001356989,0.0001510671,0.0002465347,0.007857843,0.005720591],"genre_scores_gemma":[0.651333,0.0007149703,0.3438921,0.00006410844,0.0001051233,0.0001677534,0.000857566,0.0005582609,0.002307147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002695476,"threshold_uncertainty_score":0.00535965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01072319940894612,"score_gpt":0.2268449024635828,"score_spread":0.2161217030546367,"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."}}