{"id":"W4240683705","doi":"10.1109/micro.1996.566467","title":"Software pipelining loops with conditional branches","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Software pipelining; Computer science; Very long instruction word; Parallel computing; Instruction scheduling; Compiler; Software; Instruction-level parallelism; Scheduling (production processes); Instruction set; Loop optimization; Schedule; Optimizing compiler; Dynamic priority scheduling; Operating system; Parallelism (grammar); Two-level scheduling","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":[],"consensus_categories":[],"category_scores_codex":[0.0000720949,0.00007893598,0.00007721972,0.00005854399,0.0001143589,0.000100884,0.0003326464,0.00002918663,0.0001422179],"category_scores_gemma":[0.00002100483,0.00006197292,0.00002139964,0.0002050778,0.00003134971,0.0002637705,0.0000624129,0.00006715371,0.00009344547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009513448,"about_ca_system_score_gemma":0.00001136155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003006767,"about_ca_topic_score_gemma":8.489478e-7,"domain_scores_codex":[0.9993628,0.00001928753,0.000105432,0.0002102352,0.0001627867,0.0001394385],"domain_scores_gemma":[0.9995534,0.00006728005,0.00004089772,0.0002170857,0.00007309074,0.00004822186],"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.00001186997,0.0004488818,0.0143219,0.00004115664,0.00008822355,0.00009467178,0.0022034,0.07633633,0.00006605797,0.433296,0.2032176,0.2698739],"study_design_scores_gemma":[0.0004300927,0.0001366544,0.001085583,0.00003209901,0.000003193328,0.00008203528,0.00001004285,0.9748998,0.001499645,0.01085566,0.01062586,0.0003393873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002799721,0.00006011229,0.9865595,0.0005744022,0.00003020243,0.00004279589,6.026596e-7,0.001149797,0.01130261],"genre_scores_gemma":[0.361032,0.000005722059,0.6366274,0.0007210693,0.00002568502,0.000004291771,0.000002527717,0.000004146495,0.001577147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8985634,"threshold_uncertainty_score":0.2527182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02092947466766095,"score_gpt":0.2202212724747962,"score_spread":0.1992917978071352,"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."}}