{"id":"W4249895474","doi":"10.1145/1837855.1806670","title":"A graph theoretic approach to cache-conscious placement of data for direct mapped caches","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache pollution; Cache algorithms; Parallel computing; Cache coloring; Cache invalidation; Bottleneck; Cache-oblivious algorithm; Page cache; Smart Cache; Optimizing compiler; CPU cache; Compiler; Operating system; Embedded system","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.0008653388,0.0012208,0.001087517,0.001744682,0.00140987,0.001990552,0.00241023,0.001125172,0.003691081],"category_scores_gemma":[0.003137312,0.001140274,0.00141181,0.002860042,0.001575877,0.002179284,0.00130424,0.001716122,0.0009715099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002540908,"about_ca_system_score_gemma":0.00330567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005930974,"about_ca_topic_score_gemma":0.01079704,"domain_scores_codex":[0.9990889,0.0003411672,0.00004158166,0.0001623425,0.0002822216,0.0000837576],"domain_scores_gemma":[0.9989525,0.0005090968,0.0001113989,0.000188108,0.0001893534,0.00004952351],"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.00005833048,0.0001217551,0.0004281243,0.0003516346,0.00006785711,0.0001945336,0.0002399886,0.6961838,0.005269936,0.2091848,0.005243331,0.08265593],"study_design_scores_gemma":[0.00002600182,0.00008151629,0.000136343,0.00003410262,0.0000299731,0.0001334234,0.00007996546,0.8389298,0.00204202,0.1508944,0.007583834,0.00002862645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002849156,0.0001746343,0.9940655,0.0001946671,0.00003918568,0.0001027637,0.00005925688,0.0002293018,0.002285503],"genre_scores_gemma":[0.1018623,0.0007283119,0.8928348,0.0001540739,0.00007352301,0.0002762294,0.0002423067,0.0001720467,0.003656313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005930974,"threshold_uncertainty_score":0.0184356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04559014292249517,"score_gpt":0.2956529427253662,"score_spread":0.250062799802871,"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."}}