{"id":"W2145957306","doi":"10.1109/icdcs.2009.71","title":"On Optimal Concurrency Control for Optimistic Replication","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Concurrency; Concurrency control; Distributed computing; Overhead (engineering); Replication (statistics); Parallel computing; Implementation; Metadata; Data transmission; Synchronization (alternating current); Mutual exclusion; Theoretical computer science; Computer network; Operating system; Programming language; Mathematics","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.005047871,0.0008198653,0.001000306,0.0008936793,0.001209244,0.002171692,0.001840697,0.0006906347,0.002336158],"category_scores_gemma":[0.01910758,0.0006311415,0.0005474837,0.001343248,0.002945261,0.004589381,0.003043782,0.001987241,0.0003682747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002331451,"about_ca_system_score_gemma":0.00309871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00390086,"about_ca_topic_score_gemma":0.002825861,"domain_scores_codex":[0.9950582,0.001700375,0.0003285695,0.0005634383,0.001769821,0.0005795927],"domain_scores_gemma":[0.9917675,0.00515631,0.0006196921,0.001341271,0.0008445214,0.0002706253],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006038011,0.0001038862,0.0008366767,0.0001497437,0.00003829483,0.00007981588,0.0003421123,0.5086783,0.004976485,0.3802659,0.002396548,0.1015284],"study_design_scores_gemma":[0.00007354114,0.0000719627,0.0001079524,0.00002109804,0.0000178205,0.00003335431,0.0000528094,0.8232434,0.00250139,0.1721397,0.001712091,0.00002491976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02582382,0.0008502419,0.9684263,0.0005360514,0.00006659279,0.00008324806,0.00004876705,0.0004005594,0.003764496],"genre_scores_gemma":[0.7663746,0.001027033,0.2290231,0.000215197,0.0001548667,0.0002365323,0.0001303436,0.0001767866,0.002661542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005047871,"threshold_uncertainty_score":0.02669603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01480262420838131,"score_gpt":0.2785403477861057,"score_spread":0.2637377235777244,"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."}}