{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001899256,0.00008561475,0.0001241347,0.00002433846,0.00007398102,0.00009815472,0.0004001966,0.00003710005,0.000007838264],"category_scores_gemma":[0.00008716441,0.00007116907,0.0000528782,0.0001028027,0.000008967285,0.0001480005,0.000007466463,0.00004138849,0.00003860685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002140014,"about_ca_system_score_gemma":0.00002471964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002092716,"about_ca_topic_score_gemma":1.481903e-7,"domain_scores_codex":[0.99915,0.00001402674,0.0001857035,0.0003578277,0.000115591,0.0001768989],"domain_scores_gemma":[0.9990733,0.00008898811,0.00006639164,0.0006095843,0.00009933794,0.0000624303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001292546,0.00006414675,0.000003133609,0.000003601559,0.000003883735,0.000001199749,0.00002353268,0.001483563,0.0002689154,0.9116783,0.01412846,0.0723283],"study_design_scores_gemma":[0.001539893,0.0006215093,0.000741317,0.00002420198,0.000004985237,0.000009702439,0.000004110572,0.9613926,0.0005035268,0.007897034,0.02704796,0.0002131444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000652414,0.00003860733,0.9888684,0.001770481,0.0001764623,0.0003487248,0.00001889277,0.000154284,0.00797173],"genre_scores_gemma":[0.9767763,0.000001082537,0.02146733,0.001045983,0.0000512379,0.00004294212,0.00001006227,0.000002348656,0.0006027037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9761239,"threshold_uncertainty_score":0.290219,"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."}}