{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967772,0.0007197806,0.0007906454,0.001027626,0.00082685,0.002473773,0.00378233,0.0007648866,0.001092606],"category_scores_gemma":[0.01540676,0.0009207122,0.0006168237,0.001252134,0.002236644,0.004343763,0.002436964,0.002524921,0.0003168061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005837,"about_ca_system_score_gemma":0.001461181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001740823,"about_ca_topic_score_gemma":0.00178717,"domain_scores_codex":[0.9918789,0.002605728,0.0007425856,0.0008804423,0.003357709,0.0005347303],"domain_scores_gemma":[0.9893969,0.004263872,0.0009433829,0.00349981,0.001601771,0.0002942359],"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.001888088,0.0004950881,0.009303043,0.0007366444,0.0001980776,0.0005318238,0.001832816,0.3902904,0.07825799,0.1712766,0.004490987,0.3406985],"study_design_scores_gemma":[0.0002127507,0.0002692066,0.0004789618,0.00004899528,0.00005963262,0.0002216718,0.00009187562,0.9006965,0.03036116,0.06222893,0.005274067,0.00005626966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08639646,0.001685523,0.9061494,0.0003611077,0.0001006513,0.000129289,0.00005136924,0.00253327,0.002592883],"genre_scores_gemma":[0.7717789,0.0004026864,0.2251777,0.0001866897,0.00008275178,0.0002468536,0.0001216225,0.000255946,0.001746829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005967772,"threshold_uncertainty_score":0.03156096,"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."}}