{"id":"W2055897498","doi":"10.1145/2304576.2304615","title":"Locality & utility co-optimization for practical capacity management of shared last level caches","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Leukemia and Lymphoma Society of Canada; University of Nebraska-Lincoln; National Science Foundation","keywords":"Locality; Computer science; Cache; Overhead (engineering); CPU cache; Locality of reference; Parallel computing; False sharing; Distributed computing; Bridging (networking); Cache algorithms; Computer network; Operating system","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619428,0.0001204578,0.000169711,0.00005493172,0.000104494,0.00005396474,0.0003255567,0.00007440436,0.00005544331],"category_scores_gemma":[0.00008380201,0.0001104954,0.00006919669,0.0001972565,0.00005978196,0.000572242,0.0001605161,0.00006936761,0.000007593379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004025213,"about_ca_system_score_gemma":0.00003333275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002739038,"about_ca_topic_score_gemma":0.000004895183,"domain_scores_codex":[0.9988254,0.00009681657,0.000316161,0.00025998,0.000227943,0.00027374],"domain_scores_gemma":[0.9989573,0.0001373874,0.0001512798,0.0004780529,0.0001736585,0.0001023503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001518285,0.003645382,0.031092,0.001178477,0.0003679353,0.000001533416,0.002929984,0.1069003,0.0001066679,0.7324013,0.08754565,0.03367896],"study_design_scores_gemma":[0.0004151429,0.00004444656,0.009268017,0.0000283969,0.00002137313,0.00000531418,0.00003843552,0.979644,0.003051526,0.00175029,0.005466154,0.0002668836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008947892,0.00001320934,0.9932122,0.0003596114,0.0000924665,0.0003441532,0.00001740856,0.0003143401,0.004751825],"genre_scores_gemma":[0.3255058,0.000005268128,0.6742035,0.00007625335,0.00001759305,0.00001859502,0.00001919209,0.000004258981,0.0001495506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8727437,"threshold_uncertainty_score":0.4505873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.183004534865321,"score_gpt":0.3583982554487268,"score_spread":0.1753937205834057,"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."}}