{"id":"W4253842829","doi":"10.1109/micro.2001.991118","title":"Mapping reference code to irregular DSPs within the retargetable, optimizing compiler COGEN(T)","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Compiler; Unreachable code; Dead code; Parallel computing; Code generation; Code (set theory); Programming language; Object code; Schedule; Redundant code; Set (abstract data type); Abstraction; Instruction set; 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":[],"consensus_categories":[],"category_scores_codex":[0.0008791105,0.0002044723,0.0002126808,0.0001414087,0.0004098894,0.0003309126,0.001706261,0.00007468133,0.00004170515],"category_scores_gemma":[0.00005379973,0.0001461613,0.00005660983,0.0007121199,0.0000465071,0.0003886538,0.0005638347,0.0002377346,0.0001730899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005781476,"about_ca_system_score_gemma":0.00006767431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002797192,"about_ca_topic_score_gemma":0.00001952227,"domain_scores_codex":[0.9982169,0.0001329508,0.0004097338,0.0005110507,0.0003489589,0.0003803669],"domain_scores_gemma":[0.9985246,0.0001008264,0.000132789,0.0009254843,0.0001742976,0.0001420029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009572655,0.00007716268,0.0001949544,0.00001163324,0.00004083546,0.000006297319,0.003243185,0.7884791,0.001403537,0.1401726,0.0496888,0.01667227],"study_design_scores_gemma":[0.000146277,0.00003642658,0.000207689,0.00004094994,0.000002992535,0.00002044647,0.00006296151,0.9203099,0.007175294,0.0008370538,0.07085729,0.0003027001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001418705,0.0001465683,0.9672544,0.006028406,0.0001344152,0.000270568,0.000001431244,0.001065157,0.02368033],"genre_scores_gemma":[0.2246128,0.00001318009,0.7686234,0.004293532,0.00007414866,0.00001913757,0.000003162357,0.00001187419,0.002348798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2231941,"threshold_uncertainty_score":0.5960286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03620140276435097,"score_gpt":0.2640738767487433,"score_spread":0.2278724739843923,"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."}}