{"id":"W1530989307","doi":"10.1007/3-540-45578-7_52","title":"Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Parallel computing; Constraint programming; Solver; Schedule; Dynamic priority scheduling; Two-level scheduling; Mathematical optimization; Programming language; Mathematics; Operating system","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.0004723731,0.0007477828,0.0006804641,0.0005873529,0.0007003249,0.0007880628,0.001200006,0.000478297,0.004497637],"category_scores_gemma":[0.001724124,0.0006627704,0.000399169,0.001436667,0.0004506918,0.001541873,0.0006462569,0.001107166,0.0005864414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007619921,"about_ca_system_score_gemma":0.001587655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002546471,"about_ca_topic_score_gemma":0.005988669,"domain_scores_codex":[0.9996436,0.00006077188,0.0000228135,0.00004132962,0.0001325887,0.00009891455],"domain_scores_gemma":[0.9993586,0.0003449778,0.00003974021,0.0001286776,0.00009662789,0.00003140048],"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.0008007564,0.0001600545,0.000445219,0.0003590174,0.0000563146,0.0001098544,0.0001521453,0.3748952,0.03195744,0.09122206,0.02206682,0.477775],"study_design_scores_gemma":[0.0001038637,0.000115473,0.0003037342,0.00002036803,0.0000279639,0.00005386601,0.0000353484,0.8868859,0.01265248,0.09209133,0.007691144,0.00001858542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07472681,0.003000963,0.9013509,0.0004680521,0.0003307778,0.00008804331,0.0002075119,0.002936866,0.01689004],"genre_scores_gemma":[0.5092275,0.001754495,0.4771946,0.0001182818,0.0001652547,0.0001584321,0.0004634249,0.0006620755,0.01025596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004497637,"threshold_uncertainty_score":0.01504612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01614570919910942,"score_gpt":0.2273176994822271,"score_spread":0.2111719902831176,"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."}}