{"id":"W2227036781","doi":"","title":"Constraint programming techniques for optimal instruction scheduling","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Instruction scheduling; Computer science; Register allocation; Compiler; Parallel computing; Block scheduling; Scheduling (production processes); Constraint programming; Dynamic priority scheduling; Two-level scheduling; Programming language; Mathematical optimization; Schedule; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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.002802732,0.00203763,0.001452043,0.001575477,0.001217685,0.002865236,0.002514944,0.001573486,0.0139412],"category_scores_gemma":[0.008954573,0.001371068,0.00207231,0.004703461,0.001926369,0.002560434,0.002098852,0.004779861,0.002875739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002829942,"about_ca_system_score_gemma":0.003730373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01214406,"about_ca_topic_score_gemma":0.01117555,"domain_scores_codex":[0.9975564,0.0009684247,0.0001399703,0.0002808697,0.0008470111,0.0002072011],"domain_scores_gemma":[0.9958082,0.003261766,0.0001903705,0.0002236537,0.000452043,0.0000638451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004073783,0.00006119218,0.0001522393,0.0004360621,0.00006858848,0.0001377732,0.000169619,0.3955006,0.0006254622,0.5117053,0.01580401,0.07529842],"study_design_scores_gemma":[0.00004819889,0.00002303724,0.0000716225,0.0001400411,0.00002281804,0.00005717938,0.00006388965,0.5807785,0.0004258111,0.3886267,0.02971883,0.00002342778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001030696,0.001741474,0.9744513,0.000825756,0.0001347167,0.0001588319,0.0003859953,0.0002130174,0.02105821],"genre_scores_gemma":[0.05086429,0.004702856,0.9298001,0.0003700314,0.0002772267,0.0009309698,0.0009749025,0.0004005327,0.01167909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0139412,"threshold_uncertainty_score":0.04663795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01336465924342182,"score_gpt":0.2282662762007102,"score_spread":0.2149016169572884,"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."}}