{"id":"W4378801305","doi":"10.1145/3558481.3591084","title":"An Associativity Threshold Phenomenon in Set-Associative Caches","year":2023,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Associative property; Cache; Parallel computing; Cache algorithms; Set (abstract data type); Disjoint sets; Paging; Hash function; Bus sniffing; Latency (audio); CPU cache; Cache pollution; Concurrency; Theoretical computer science; Distributed computing; Computer network; Programming language; Mathematics; Discrete mathematics","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.001035887,0.00008416558,0.0001275336,0.0001692845,0.00009157426,0.000161193,0.0004852516,0.00005731003,0.00004296209],"category_scores_gemma":[0.00005748306,0.00007730195,0.00002599494,0.001243728,0.00001687791,0.0007548302,0.0001607132,0.0001377451,0.0001925496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001419684,"about_ca_system_score_gemma":0.00006999315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001075141,"about_ca_topic_score_gemma":0.0003635025,"domain_scores_codex":[0.9987776,0.0001493009,0.0001474296,0.0002878188,0.0002970122,0.0003408846],"domain_scores_gemma":[0.9994305,0.0001234639,0.00005062896,0.0002516886,0.00005840006,0.00008526717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008900271,0.0007190629,0.4528998,0.00003049452,0.00005901371,0.00005712658,0.05330338,0.032599,0.001297837,0.4172295,0.0132566,0.02853929],"study_design_scores_gemma":[0.0004620928,0.00009492774,0.1368403,0.000005877676,8.756184e-7,1.766483e-7,0.0005236096,0.8424878,0.0002417915,0.01883721,0.0002983684,0.0002070109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4621752,0.00004004392,0.279521,0.01839262,0.0006383909,0.001286027,0.00003153432,0.003613651,0.2343015],"genre_scores_gemma":[0.9921178,0.00001989493,0.00471841,0.0004204233,0.00002084688,0.00002266296,0.0000130274,0.000007290221,0.002659654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8098888,"threshold_uncertainty_score":0.3152282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05717537965124962,"score_gpt":0.3263075660319567,"score_spread":0.2691321863807071,"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."}}