{"id":"W2076662080","doi":"10.1109/micro.2010.25","title":"Hardware Support for Relaxed Concurrency Control in Transactional Memory","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Transactional memory; Computer science; Serializability; Concurrency control; Commit; Software transactional memory; Optimistic concurrency control; Distributed computing; Multiversion concurrency control; Two-phase locking; Serialization; Parallel computing; Cache coherence; Operating system; Database transaction; Cache; Transaction processing; Distributed transaction; Distributed concurrency control; Programming language; Cache algorithms; CPU cache; 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.0003165257,0.00009881594,0.0001727014,0.00004890547,0.00005540752,0.00006646256,0.0004250775,0.00008315239,0.0001364666],"category_scores_gemma":[0.00002052869,0.00008656335,0.00008066755,0.0001337391,0.00002556342,0.0003484937,0.000009392536,0.0001743559,0.0000421665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001375282,"about_ca_system_score_gemma":0.0001130581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003242058,"about_ca_topic_score_gemma":0.0001514087,"domain_scores_codex":[0.999037,0.00001369146,0.0002671012,0.0002857076,0.0001606846,0.0002358225],"domain_scores_gemma":[0.9994239,0.00007581298,0.00004930298,0.0002734926,0.00009810698,0.00007940028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001279569,0.0007439858,0.007426343,0.0001733672,0.00008472602,0.0000689312,0.001336607,0.0003880089,0.02492774,0.6690249,0.08112704,0.2145703],"study_design_scores_gemma":[0.01345515,0.0003306549,0.02457888,0.00004754656,0.0000148567,0.0001256417,0.0001086809,0.3444281,0.003977077,0.004112353,0.6078433,0.0009778209],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002602425,0.00001829646,0.985231,0.001038879,0.001689559,0.0003851353,0.00008776324,0.0001045622,0.008842352],"genre_scores_gemma":[0.9916487,7.298647e-7,0.005781202,0.0003531372,0.00007799279,0.0001103483,0.00001386295,0.000004990697,0.002009007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9890463,"threshold_uncertainty_score":0.3529951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009234825785726632,"score_gpt":0.2456676460433013,"score_spread":0.2364328202575747,"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."}}