{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006964474,0.0003418784,0.0004978017,0.0001144124,0.000479641,0.0007485654,0.001153374,0.0001264631,0.000003079709],"category_scores_gemma":[0.00003230267,0.000313598,0.0002205839,0.0005090758,0.00004570535,0.00006976583,0.0002967799,0.0001288279,0.0001601459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001385685,"about_ca_system_score_gemma":0.00006893254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001647895,"about_ca_topic_score_gemma":0.000001888545,"domain_scores_codex":[0.9970927,0.0001330961,0.0007807489,0.0007627259,0.0004159699,0.000814766],"domain_scores_gemma":[0.9981816,0.000398804,0.0002997943,0.0006896144,0.0002780382,0.0001521454],"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.00000577131,0.0001150275,0.0001306161,0.00006234928,0.00002847321,0.00001215054,0.00003881067,0.9704124,0.0007103114,0.02579851,0.002430002,0.0002555897],"study_design_scores_gemma":[0.0006764625,0.00007855925,0.0001409804,0.00009177034,0.00001068493,0.0001070025,0.00001086707,0.9909662,0.0001283657,0.0002069484,0.007178643,0.0004035333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08036898,0.0003499623,0.9151834,0.0001510189,0.001130913,0.0007014177,0.0001176303,0.001018685,0.0009780483],"genre_scores_gemma":[0.9720945,2.052416e-7,0.02681387,0.00006525954,0.0004518083,0.0000209378,0.000260887,0.00002353026,0.0002689615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8917255,"threshold_uncertainty_score":0.9999316,"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."}}