{"id":"W1973991062","doi":"10.1109/tpds.2011.287","title":"Relaxed Concurrency Control in Software Transactional Memory","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Software transactional memory; Concurrency control; Optimistic concurrency control; Multiversion concurrency control; Transactional memory; Distributed computing; Concurrency; Parallel computing; Commit; Non-lock concurrency control; Distributed concurrency control; Database transaction; Operating system; Distributed transaction; Transaction processing; Programming language; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003602568,0.0003473622,0.0005227568,0.0001886083,0.000248525,0.0001326859,0.0004780651,0.0002322556,0.00003754668],"category_scores_gemma":[0.000006807195,0.0003231076,0.000150482,0.0005313081,0.00009939199,0.0005879935,0.000001996483,0.0004035945,0.00006386563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009710772,"about_ca_system_score_gemma":0.000100278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005493288,"about_ca_topic_score_gemma":0.00006860401,"domain_scores_codex":[0.9975018,0.0002143397,0.0007285856,0.0006683187,0.0003826598,0.0005042857],"domain_scores_gemma":[0.998792,0.0001399782,0.0001627024,0.0005157586,0.0001262465,0.0002632925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002262554,0.007580903,0.005603199,0.001355391,0.001318495,0.001230915,0.01027773,0.8377194,0.001567937,0.04040182,0.008108846,0.08257275],"study_design_scores_gemma":[0.03122086,0.001734998,0.02505354,0.001418862,0.0002238318,0.001284152,0.002215345,0.9180382,0.0005626219,0.002086316,0.01193427,0.004226924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003045804,0.0006266505,0.9923627,0.00009559903,0.001594158,0.0005878148,0.0009109736,0.0002806211,0.000495672],"genre_scores_gemma":[0.9983792,0.00005301585,0.0009083253,0.0000774998,0.00003295009,0.0002856991,0.00002507373,0.00001579291,0.0002224525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9953334,"threshold_uncertainty_score":0.9999221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02359496933191434,"score_gpt":0.2198245264976142,"score_spread":0.1962295571656998,"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."}}