{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934696,0.0003238135,0.0001861897,0.0002195314,0.0002552706,0.0002688691,0.0004146633,0.0001489744,0.0009796148],"category_scores_gemma":[0.00142714,0.0001800007,0.0002415371,0.0002424061,0.0004059836,0.000461831,0.0003540898,0.0003279471,0.000177453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002765449,"about_ca_system_score_gemma":0.0009243608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293472,"about_ca_topic_score_gemma":0.00181579,"domain_scores_codex":[0.9998072,0.0000427971,0.00001465701,0.00003472888,0.00005789851,0.00004269266],"domain_scores_gemma":[0.9991422,0.0003706662,0.000125967,0.0001603318,0.0001636515,0.000037201],"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.0007435621,0.0001458051,0.01103925,0.0003360104,0.00005849947,0.0005363618,0.0006803284,0.1620235,0.2953043,0.05236555,0.00441442,0.4723524],"study_design_scores_gemma":[0.0000849323,0.0005835105,0.002104406,0.0000292722,0.00006107825,0.0004203714,0.00004782885,0.6333437,0.3194765,0.02397622,0.01983774,0.00003442523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3129667,0.0002189808,0.6771054,0.0001191559,0.00004471263,0.00008413655,0.00006620171,0.004445936,0.004948749],"genre_scores_gemma":[0.7629302,0.0001181969,0.2341485,0.00006573043,0.00001995273,0.00005005999,0.0001590979,0.0002243799,0.002283813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001293472,"threshold_uncertainty_score":0.003277123,"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."}}