{"id":"W2771425872","doi":"10.21203/rs.3.rs-2540689/v1","title":"Cost of Concurrency in Hybrid Transactional Memory","year":2023,"lang":"en","type":"article","venue":"Research Square","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Toronto; Ontario Centres of Excellence","keywords":"Transactional memory; Computer science; Concurrency; Multiversion concurrency control; Concurrency control; Parallel computing; Software transactional memory; Programming language; Distributed concurrency control; Database transaction","routes":{"ca_aff":true,"ca_fund":true,"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.001397278,0.00006275757,0.0001425505,0.0003222338,0.00006945804,0.00004627248,0.0005769687,0.00003232589,0.00004414486],"category_scores_gemma":[0.00008223538,0.00005951703,0.00005013837,0.001694892,0.00007517046,0.0002345707,0.00007599012,0.0002547663,0.0001979087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005769565,"about_ca_system_score_gemma":0.0001848759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001137759,"about_ca_topic_score_gemma":0.00002748845,"domain_scores_codex":[0.9981352,0.0001920599,0.0002304268,0.0002581057,0.0007936897,0.0003905222],"domain_scores_gemma":[0.9990857,0.000240133,0.00002778009,0.0003269815,0.0002345408,0.00008489386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008413185,0.0009212007,0.01962149,0.001856764,0.0000632278,0.001051043,0.005659363,0.007216909,0.006391109,0.1139446,0.09159341,0.7515968],"study_design_scores_gemma":[0.005257017,0.0007292387,0.3584725,0.001935428,0.000003243754,0.00007658832,0.00209108,0.4877568,0.01878432,0.01263737,0.1113318,0.0009246217],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4420888,0.003545305,0.5017806,0.006991639,0.002530589,0.003998839,0.001231428,0.0008862967,0.03694651],"genre_scores_gemma":[0.9992793,0.00004102014,0.00009964463,0.000006261901,0.00003284118,0.00006812131,0.00001960506,0.000004456359,0.0004487428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7506722,"threshold_uncertainty_score":0.2543782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1114959553581296,"score_gpt":0.4097826165273684,"score_spread":0.2982866611692387,"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."}}