{"id":"W2170236656","doi":"10.1109/ccnc.2007.114","title":"Low Cost Peer-to-Peer Collaborative Caching for Clusters","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Scheme (mathematics); Peer-to-peer; False sharing; Distributed computing; Data sharing; Cluster (spacecraft); Computer network; Storage management; Computer data storage; Software; Operating system; Cache; CPU cache; Cache algorithms","routes":{"ca_aff":true,"ca_fund":true,"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.001781147,0.0001542441,0.0001874613,0.0001064664,0.000215807,0.0003285969,0.0007640882,0.00006454881,0.000004983917],"category_scores_gemma":[0.0002079621,0.0001353541,0.00006240534,0.0006498299,0.00001629143,0.0002139805,0.0001585499,0.0000910216,0.00009675307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008625264,"about_ca_system_score_gemma":0.00009497322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004892668,"about_ca_topic_score_gemma":0.00009446329,"domain_scores_codex":[0.9983259,0.00004150444,0.0002883461,0.0003946277,0.0004698843,0.0004797471],"domain_scores_gemma":[0.9982151,0.0003438934,0.00008047479,0.0003725339,0.0007741232,0.0002138677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001176523,0.0002453451,0.001152048,0.00009764517,0.0001169617,0.00005220394,0.01231442,0.0852671,0.0006155635,0.1299078,0.6839644,0.08614884],"study_design_scores_gemma":[0.001282348,0.0002663179,0.0009379509,0.00007950937,0.000007430571,0.00002168966,0.0007296035,0.1886459,0.003086558,0.0004744339,0.8038372,0.0006309982],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00354291,0.000009146932,0.9730978,0.003941318,0.001200494,0.0007104989,0.00002518377,0.0002370679,0.0172356],"genre_scores_gemma":[0.9233661,1.297318e-7,0.06536726,0.001462733,0.0002056162,0.00002083721,0.00002467883,0.00001053919,0.009542078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9198232,"threshold_uncertainty_score":0.551958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01714336517590908,"score_gpt":0.2950859024631056,"score_spread":0.2779425372871965,"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."}}