{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001311974,0.00008127007,0.00007631143,0.0001198862,0.0001845086,0.000140189,0.0003025939,0.00004479706,0.00003134006],"category_scores_gemma":[0.000004648688,0.00007812338,0.00004033319,0.000361445,0.00001728983,0.0005912083,0.00003845346,0.0000487845,0.00001023911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000030642,"about_ca_system_score_gemma":0.0000412784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007303047,"about_ca_topic_score_gemma":0.000002736568,"domain_scores_codex":[0.9993222,0.00003181716,0.0002058842,0.0001568124,0.0001349743,0.0001482772],"domain_scores_gemma":[0.9995973,0.00001955711,0.00005194496,0.0002186262,0.00008435905,0.00002829095],"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":[2.999195e-7,0.00002077754,0.00001865449,0.000002239633,0.000001510964,4.743904e-7,0.00004158693,0.9773303,0.00005873341,0.01979921,0.001276747,0.001449417],"study_design_scores_gemma":[0.000106484,0.000008495266,0.00002640647,0.000005153239,0.000002307813,0.000008250464,0.00000484756,0.9952218,0.002893369,0.001427725,0.0001870273,0.0001081368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005205543,0.00003609706,0.9628704,0.000304442,0.00007658766,0.00009489885,4.310398e-7,0.0009234097,0.03517315],"genre_scores_gemma":[0.1076252,0.000006754091,0.8914815,0.0001785996,0.00003599711,0.000003320136,0.000007065413,0.000005533094,0.0006561187],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1071046,"threshold_uncertainty_score":0.3185779,"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."}}