{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000317742,0.000457655,0.0003866867,0.0007555833,0.0003631011,0.000635101,0.001115433,0.0002703095,0.00002707204],"category_scores_gemma":[0.00005076074,0.0004062743,0.0000860885,0.0007062676,0.0005789965,0.001172649,0.0002562394,0.0004972705,0.000009843583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002440002,"about_ca_system_score_gemma":0.0006079578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008732376,"about_ca_topic_score_gemma":0.00006286055,"domain_scores_codex":[0.9971735,0.00001401464,0.0004235633,0.001224545,0.0006486565,0.0005157148],"domain_scores_gemma":[0.9983961,0.0001739839,0.0003209085,0.000570535,0.0003999929,0.0001384688],"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.00001947364,0.00001840528,0.00007159279,0.00004823269,0.00001084372,0.0000199887,0.000531828,0.395354,0.0001135538,0.005590972,0.000002090127,0.598219],"study_design_scores_gemma":[0.000691371,0.0004344979,0.00007483539,0.0005130551,0.00001615691,0.000473,0.000002080178,0.9767768,0.002324573,0.01646397,0.001411146,0.0008184696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005199479,0.00009842831,0.9931458,0.0007279274,0.001037501,0.0005774886,0.000004607514,0.000255813,0.003632443],"genre_scores_gemma":[0.05673834,0.00002954163,0.9419546,0.0005242754,0.0004247304,0.00002056543,0.00001230082,0.00003628582,0.0002594184],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5974005,"threshold_uncertainty_score":0.9998389,"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."}}