{"id":"W2139541175","doi":"10.1109/71.932715","title":"Efficient local search far DAG scheduling","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Fair-share scheduling; Two-level scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Directed acyclic graph; Scheduling (production processes); Distributed computing; Incremental heuristic search; Algorithm; Schedule; Beam search; Search algorithm; Parallel computing; Mathematical optimization; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093373,0.0005382515,0.001089887,0.0008544315,0.0008869408,0.0009693552,0.001229061,0.0007070696,0.004539149],"category_scores_gemma":[0.003479912,0.0003849342,0.0005002999,0.001533216,0.0005881714,0.001595264,0.001734627,0.0008316162,0.00146452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001012883,"about_ca_system_score_gemma":0.001511595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002528622,"about_ca_topic_score_gemma":0.004636335,"domain_scores_codex":[0.9990816,0.0003786903,0.00003349109,0.00009324228,0.0002461119,0.0001669617],"domain_scores_gemma":[0.9985713,0.0006461839,0.0001051756,0.00037379,0.0001917775,0.0001117482],"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.0006193505,0.0001778505,0.000651469,0.0002367689,0.00006266599,0.0001474577,0.0001807275,0.6978694,0.01233607,0.04624511,0.01605602,0.2254171],"study_design_scores_gemma":[0.00008236702,0.0001057194,0.0001769636,0.000008415502,0.00001551236,0.00004023773,0.00004488197,0.9673441,0.003336597,0.02467092,0.004159344,0.00001483835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03950306,0.0009536896,0.9490381,0.0003196854,0.0001011763,0.0001026008,0.0001802057,0.002778908,0.007022534],"genre_scores_gemma":[0.6616815,0.0005691359,0.3272036,0.0002117653,0.00008026144,0.0002968415,0.0007794018,0.0004040939,0.008773386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004539149,"threshold_uncertainty_score":0.015185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02467852927785577,"score_gpt":0.2528306202013057,"score_spread":0.2281520909234499,"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."}}