{"id":"W2147483891","doi":"10.1109/newcas.2006.250903","title":"SoC memory optimization using loop transformations","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Loop fusion; Loop tiling; Cache; Parallel computing; Memory hierarchy; Loop optimization; Write buffer; Compiler; Loop fission; Loop (graph theory); Reduction (mathematics); CPU cache; Set (abstract data type); Factor (programming language); Compile time; Cache algorithms; Optimizing compiler; Operating system; Programming language","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.0001283587,0.0003761293,0.0002242194,0.000317788,0.0001840227,0.0002723703,0.000327163,0.0001360024,0.002454236],"category_scores_gemma":[0.0004609149,0.0001028776,0.0002736191,0.0003748808,0.0002106815,0.0003645557,0.0003309538,0.0002232034,0.0002590582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002216745,"about_ca_system_score_gemma":0.0004476995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103842,"about_ca_topic_score_gemma":0.001577108,"domain_scores_codex":[0.9998978,0.00001679819,0.000005719666,0.00001682025,0.00003788638,0.00002490623],"domain_scores_gemma":[0.9998727,0.00004241518,0.00002471224,0.00002727926,0.00002810912,0.000004810229],"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.0003475093,0.0001110439,0.001615037,0.0002081366,0.00004768667,0.0001758322,0.0001618984,0.5243235,0.1143066,0.02492757,0.003135925,0.3306393],"study_design_scores_gemma":[0.00005626533,0.0002696518,0.0005835685,0.000009949509,0.00003065088,0.00009892528,0.00004215848,0.9026608,0.07612742,0.0102459,0.009863576,0.00001115498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2396647,0.0004188919,0.7399682,0.00009901424,0.00005090656,0.00007596392,0.0001434975,0.005824775,0.01375399],"genre_scores_gemma":[0.8592029,0.0001486431,0.1359919,0.00006339002,0.00001800046,0.00008217873,0.0001802775,0.0004649313,0.003847728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002454236,"threshold_uncertainty_score":0.008210182,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01740077241715269,"score_gpt":0.2509992566508528,"score_spread":0.2335984842337001,"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."}}