{"id":"W2025042589","doi":"10.1007/s00607-013-0375-4","title":"TurboLock: increasing associativity of lock table in transactional memory","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transactional memory; Software transactional memory; Lock (firearm); Parallel computing; Overhead (engineering); Concurrency; Exploit; Table (database); Distributed computing; Operating system; Programming language; Computer security; Database transaction; Data mining","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.0006278389,0.00009336459,0.0002278917,0.00006405902,0.00007356251,0.00007214533,0.0003665676,0.0000575805,0.00001269996],"category_scores_gemma":[0.0000662052,0.00009426961,0.00004520005,0.0004414741,0.00002169628,0.0003716983,0.00007469604,0.0001489257,0.00001735117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007001706,"about_ca_system_score_gemma":0.00006292026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271195,"about_ca_topic_score_gemma":0.00001662042,"domain_scores_codex":[0.9988458,0.0001293573,0.0003233607,0.000231827,0.0002144311,0.0002551948],"domain_scores_gemma":[0.9992533,0.000224939,0.0001635232,0.0002030009,0.0001085112,0.00004668063],"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.00002314715,0.001108171,0.2806352,0.0004538712,0.0001479681,0.00004473842,0.007496819,0.08306669,0.03588647,0.0168052,0.004798607,0.5695331],"study_design_scores_gemma":[0.0004866782,0.00002049186,0.2542009,0.0001635266,0.000001926939,0.00001528685,0.00008176293,0.7421756,0.001751858,0.0006884955,0.0002251259,0.0001882811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6420934,0.0001032862,0.3551893,0.0001265521,0.0002227869,0.0001111453,0.000002538266,0.00005049823,0.002100553],"genre_scores_gemma":[0.9909037,7.361716e-7,0.008943437,0.00004774609,0.0000480726,0.000002798821,0.000001645689,0.00000428154,0.00004757741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.659109,"threshold_uncertainty_score":0.3844203,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008302495638667196,"score_gpt":0.2172443057043419,"score_spread":0.2089418100656747,"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."}}