{"id":"W1981209094","doi":"10.1109/icpp.2013.81","title":"Read-Write Lock Allocation in Software Transactional Memory","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software transactional memory; Transactional memory; Computer science; Lock (firearm); Exploit; Distributed computing; Overhead (engineering); Bottleneck; Consistency model; Parallel computing; Database transaction; Data consistency; Operating system; Embedded system; Database; Computer security","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.0001199839,0.00007847381,0.00009563394,0.00005546609,0.0000388744,0.000103597,0.0003275521,0.00005137826,0.0002439552],"category_scores_gemma":[0.000007755333,0.00006955484,0.0000311564,0.0002561704,0.00001338318,0.0007371322,0.00001763452,0.00008057406,0.0004250871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003731536,"about_ca_system_score_gemma":0.0000368658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006553388,"about_ca_topic_score_gemma":0.0001058423,"domain_scores_codex":[0.9991832,0.00002219034,0.0002041585,0.0002352957,0.0001866975,0.0001683956],"domain_scores_gemma":[0.9995335,0.00002706655,0.00003295075,0.0002652599,0.00008517021,0.00005598993],"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.0000101351,0.0005318801,0.00735212,0.000127029,0.00003975657,0.00002785167,0.001922333,0.007577514,0.002936802,0.07427114,0.05253816,0.8526652],"study_design_scores_gemma":[0.002739099,0.0001607415,0.3326041,0.0002455381,0.00000655858,0.0001213946,0.0004912148,0.58178,0.003348864,0.01327497,0.06384246,0.001385143],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01002608,0.00007006904,0.9818374,0.001443753,0.0002317806,0.0001866959,0.000002258069,0.0001506638,0.006051305],"genre_scores_gemma":[0.9741145,0.000004403832,0.02129881,0.0004036693,0.0000382255,0.00006205476,0.000008511543,0.000004444528,0.004065338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9640884,"threshold_uncertainty_score":0.5463777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009258107240865556,"score_gpt":0.2134051193489998,"score_spread":0.2041470121081342,"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."}}