{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003832261,0.0006838448,0.0007717072,0.0006117684,0.0007915146,0.002388659,0.002625148,0.0007608823,0.001360494],"category_scores_gemma":[0.01354738,0.0006932691,0.0007527023,0.00105461,0.002242419,0.004590333,0.002466406,0.003004757,0.0003414692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008973813,"about_ca_system_score_gemma":0.001703621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001486956,"about_ca_topic_score_gemma":0.001288975,"domain_scores_codex":[0.9944437,0.001631071,0.0004149219,0.0005694786,0.002424155,0.0005166968],"domain_scores_gemma":[0.9911198,0.004378106,0.0005111631,0.002674454,0.001109833,0.0002067758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007741654,0.0005376441,0.004572074,0.0006757518,0.000140893,0.0003880591,0.001654508,0.3109049,0.08288426,0.2658309,0.002419077,0.3292176],"study_design_scores_gemma":[0.0003004591,0.000373411,0.0005704687,0.00007502564,0.0001004658,0.0002449504,0.0001367578,0.80708,0.05045817,0.1281845,0.01241076,0.00006516824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0753898,0.00141198,0.9172357,0.0004604413,0.0001153242,0.0001451379,0.00002347629,0.001073026,0.004145015],"genre_scores_gemma":[0.6906273,0.001079763,0.3040763,0.000238472,0.0001483434,0.0002927662,0.00009852742,0.0002439573,0.003194632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003832261,"threshold_uncertainty_score":0.02026719,"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."}}