{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069571,0.0004317194,0.0004347863,0.0003596541,0.0003836407,0.0005004954,0.001060758,0.0003053585,0.001161393],"category_scores_gemma":[0.001994178,0.0002070651,0.0002303312,0.0005864229,0.0004598491,0.0008431583,0.0007760648,0.0004440511,0.0002020967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008518277,"about_ca_system_score_gemma":0.001080261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001906762,"about_ca_topic_score_gemma":0.003590188,"domain_scores_codex":[0.9994604,0.0001562837,0.00002402184,0.00006245134,0.0001569001,0.0001398831],"domain_scores_gemma":[0.999076,0.0003657665,0.0001473779,0.0001613493,0.0001908364,0.00005874933],"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":[0.0002185102,0.0001204849,0.001656238,0.00008678863,0.00004359568,0.00009207254,0.0001170453,0.8480083,0.02276025,0.0151716,0.002246127,0.109479],"study_design_scores_gemma":[0.00001022498,0.00003682441,0.0001499802,0.000003175121,0.000007843158,0.00002430655,0.00001544549,0.9927139,0.003478441,0.002848673,0.0007060444,0.00000526399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1470175,0.0009398137,0.8461577,0.000269003,0.00002486918,0.00005330499,0.00005871904,0.0008550087,0.004624049],"genre_scores_gemma":[0.9492511,0.00009599459,0.04941548,0.00003730816,0.00001356865,0.00003575096,0.00003577511,0.00006804906,0.001046908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001906762,"threshold_uncertainty_score":0.006180465,"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."}}