{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004339453,0.0002882376,0.0002124633,0.0002362557,0.0003502605,0.0004125972,0.002599477,0.0001081648,0.00003709277],"category_scores_gemma":[0.00005967702,0.0002161977,0.000102891,0.0005707754,0.00007237614,0.0001564738,0.0005299448,0.0005016609,0.0001086221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001213382,"about_ca_system_score_gemma":0.00005286355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004528173,"about_ca_topic_score_gemma":0.00001826316,"domain_scores_codex":[0.9978282,0.0001628171,0.0004224973,0.0006657828,0.0005571218,0.0003635718],"domain_scores_gemma":[0.998533,0.0001545752,0.0001978751,0.0007380583,0.0002439292,0.0001325856],"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.0001037565,0.0001384681,0.0004868691,0.000009749962,0.0001280661,0.00005617133,0.003907502,0.8967173,0.05689343,0.02294801,0.01030679,0.008303965],"study_design_scores_gemma":[0.0009538357,0.0003075765,0.001668385,0.000406941,0.00001441619,0.000644962,0.0001154198,0.4682772,0.04639321,0.004962027,0.4750409,0.001215124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01754664,0.00008591003,0.941143,0.02586262,0.0007692577,0.0003718097,0.00001857505,0.0005528059,0.01364938],"genre_scores_gemma":[0.6416408,0.00005008309,0.345469,0.009879876,0.000324291,0.0000560043,0.00004482895,0.00003793306,0.002497212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6240941,"threshold_uncertainty_score":0.8816288,"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."}}