{"id":"W2121522147","doi":"10.5555/563998.564024","title":"Mapping reference code to irregular DSPs within the retargetable, optimizing compiler COGEN(T)","year":2001,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Compiler; Dead code; Unreachable code; Code (set theory); Parallel computing; Code generation; Programming language; Redundant code; Object code; Schedule; Abstraction; Set (abstract data type); Dead code elimination; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002659165,0.0002676912,0.0002113281,0.000290524,0.0002187245,0.0004623556,0.0006761391,0.0003377275,0.001275867],"category_scores_gemma":[0.0009929995,0.0002004539,0.0002190221,0.0003171016,0.0005226536,0.00045123,0.0003679609,0.0005163025,0.000363342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003601401,"about_ca_system_score_gemma":0.000677611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00146973,"about_ca_topic_score_gemma":0.00193679,"domain_scores_codex":[0.9998329,0.00002369038,0.000008548234,0.00004357078,0.00006481332,0.00002646316],"domain_scores_gemma":[0.9996647,0.00008372263,0.00003997596,0.0001163233,0.0000830661,0.00001236614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004498906,0.0001533837,0.002713847,0.0002043298,0.00003705702,0.0004364937,0.0004318338,0.3863871,0.1695114,0.05458463,0.006335579,0.3787544],"study_design_scores_gemma":[0.00008061949,0.0002857021,0.0009556101,0.0000213067,0.0000270468,0.000272259,0.00004972178,0.840688,0.1239907,0.01132997,0.02227215,0.00002691093],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2630816,0.0002050305,0.7162368,0.0001598883,0.00005596782,0.0001224517,0.000123123,0.01034956,0.009665591],"genre_scores_gemma":[0.4654098,0.0001350279,0.5284162,0.0001166689,0.0000121302,0.00008346858,0.0003201845,0.001123781,0.004382723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00146973,"threshold_uncertainty_score":0.004268229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01927482218811427,"score_gpt":0.2599013811475154,"score_spread":0.2406265589594012,"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."}}