{"id":"W4254192086","doi":"10.1109/ideas.2004.1319805","title":"Interoperable server-based cache consistency algorithm","year":2004,"lang":"en","type":"article","venue":"","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Cache; Commit; Concurrency control; Callback; Operating system; Client-side; False sharing; Transactional memory; Consistency (knowledge bases); Cache algorithms; Database transaction; Distributed computing; Database; Computer network; CPU cache","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002098907,0.0001152498,0.0001126218,0.00007017582,0.000145668,0.0001531964,0.0007179201,0.00003156859,0.00002729745],"category_scores_gemma":[0.000009580127,0.00008938859,0.00007379629,0.0002706973,0.00003271946,0.00002210605,0.0003079841,0.00009767777,0.0002007037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000689856,"about_ca_system_score_gemma":0.00006444484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005006375,"about_ca_topic_score_gemma":0.00002623171,"domain_scores_codex":[0.9990165,0.00003130989,0.0001645227,0.0003242625,0.000209552,0.0002538216],"domain_scores_gemma":[0.9992536,0.00002405818,0.00003418922,0.0005595862,0.00004751338,0.00008102732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004043022,0.0006896515,0.0002749024,0.00005540489,0.00008883253,0.0002359224,0.001006559,0.2309438,0.0001494465,0.1180878,0.003540371,0.6449233],"study_design_scores_gemma":[0.00143162,0.0002187127,0.0004126999,0.00007318133,0.00000901871,0.00002166183,0.0001060074,0.9720395,0.003744687,0.003590819,0.01797645,0.0003756803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02643901,0.00007018235,0.9458682,0.004199197,0.0003294063,0.0001016196,2.380913e-7,0.0004686683,0.02252349],"genre_scores_gemma":[0.822497,5.963652e-7,0.1718384,0.002505583,0.00005009914,0.000005289937,6.686288e-7,0.000007315791,0.003095068],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.796058,"threshold_uncertainty_score":0.3645161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01445848952919558,"score_gpt":0.2207740782062566,"score_spread":0.206315588677061,"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."}}