{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002784419,0.0002829023,0.0002300575,0.0002934666,0.0002387026,0.0004963701,0.0006902829,0.0003173,0.00146112],"category_scores_gemma":[0.001007904,0.0002017547,0.0002422843,0.0003357172,0.0005475247,0.0004796192,0.0003590102,0.0005645149,0.000406243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004000585,"about_ca_system_score_gemma":0.0007260816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001422461,"about_ca_topic_score_gemma":0.001907918,"domain_scores_codex":[0.9998241,0.00002510408,0.000009048775,0.00004826743,0.00006750459,0.00002604627],"domain_scores_gemma":[0.9996606,0.00008704943,0.00003681145,0.000115652,0.00008810092,0.00001182687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004244223,0.0001353735,0.002218136,0.000229352,0.00003641419,0.0004256723,0.0004663775,0.4044141,0.1407615,0.0780376,0.007065595,0.3657854],"study_design_scores_gemma":[0.00008734505,0.0002628966,0.0008565749,0.00002653579,0.00002758386,0.0003075344,0.00005829565,0.8179465,0.1320163,0.01581498,0.03256398,0.0000314411],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1788125,0.0001601383,0.8003812,0.000136663,0.00005074409,0.0001139443,0.0001314368,0.009478352,0.01073501],"genre_scores_gemma":[0.3876588,0.0001281262,0.6058536,0.0001005797,0.00001129295,0.00008815047,0.0003504811,0.001338829,0.004470111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00146112,"threshold_uncertainty_score":0.004887938,"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."}}