{"id":"W2185434560","doi":"","title":"Relaxing concurrency control in transactional memory","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Software transactional memory; Transactional memory; Concurrency control; Optimistic concurrency control; Multiversion concurrency control; Distributed computing; Commit; Two-phase locking; Parallel computing; Non-lock concurrency control; Concurrency; Distributed concurrency control; Operating system; Database transaction; Programming language; Transaction processing; Distributed transaction; Database","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.0002176536,0.0002194602,0.0003475977,0.0001477832,0.00005414792,0.00007533661,0.0006523443,0.0002533846,0.0001867152],"category_scores_gemma":[0.000008181533,0.0002072531,0.0001168471,0.0002422335,0.00001074129,0.0003698778,0.00000576544,0.0003595669,0.0001151681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000440006,"about_ca_system_score_gemma":0.000183398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003408324,"about_ca_topic_score_gemma":0.0007054844,"domain_scores_codex":[0.9984973,0.0000432489,0.0004630354,0.0004595103,0.0002776955,0.0002591927],"domain_scores_gemma":[0.999297,0.00003700168,0.0001658747,0.0003265316,0.0001040576,0.00006958965],"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.0002738096,0.0009486804,0.00154671,0.001076678,0.0003293224,0.0003640417,0.01317369,0.0003191695,0.001624447,0.5086244,0.01656234,0.4551567],"study_design_scores_gemma":[0.04381619,0.00137151,0.2564357,0.01001216,0.0003602303,0.0004087837,0.006958103,0.3806307,0.009616798,0.04823437,0.2258816,0.01627379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004431596,0.001800674,0.6299712,0.00007939693,0.006455727,0.000645151,0.00004836791,0.0002882413,0.3562796],"genre_scores_gemma":[0.9783177,0.00002629858,0.0009111756,0.0001074331,0.00008260472,0.00009317049,0.0001515465,0.00001580059,0.02029427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738861,"threshold_uncertainty_score":0.8451538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01097616244453463,"score_gpt":0.2328241979040191,"score_spread":0.2218480354594845,"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."}}