{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001717045,0.0002328837,0.0003538099,0.0003914118,0.0003763587,0.00005827611,0.000766694,0.0003316393,0.000004929403],"category_scores_gemma":[0.00002021607,0.0002902129,0.000203389,0.0002612855,0.0001000264,0.0003743691,0.00009411213,0.0002210711,0.000002677122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007579244,"about_ca_system_score_gemma":0.0001678645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001357582,"about_ca_topic_score_gemma":0.0003812566,"domain_scores_codex":[0.9988068,0.00003843532,0.0001838798,0.0004738711,0.000223491,0.0002734622],"domain_scores_gemma":[0.998758,0.00003336308,0.0004022929,0.0003405541,0.0003933039,0.00007246181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003300208,0.0003303449,0.0001367159,0.001206414,0.0003378818,0.00007029613,0.1509024,0.005767481,0.003742082,0.01569386,0.002762381,0.8187201],"study_design_scores_gemma":[0.005368742,0.003098393,0.0007013722,0.003679327,0.0004544069,0.0002729397,0.1366047,0.600149,0.2131665,0.002978104,0.02817651,0.005349962],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2155287,0.00008783322,0.7815588,0.000238174,0.0003137075,0.0007770204,0.000009109618,0.001121365,0.0003653913],"genre_scores_gemma":[0.01330198,0.0001544668,0.9642594,0.000008611226,0.000043959,0.000003324334,0.0001897763,0.00001989268,0.02201854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8133701,"threshold_uncertainty_score":0.999955,"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."}}