{"id":"W2907775321","doi":"10.1145/3309202","title":"Group Mutual Exclusion by Fetch-and-increment","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Concurrency; Computer science; Scalability; Synchronization (alternating current); Fetch; Shared memory; Parallel computing; Distributed computing; Concurrency control; Shared resource; Group (periodic table); Resource (disambiguation); Simple (philosophy); Operating system; Computer network; Programming language; Channel (broadcasting)","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.0003549285,0.0002055168,0.0002098444,0.00007888233,0.0007394955,0.0001889369,0.0008109966,0.00008398108,0.00002359896],"category_scores_gemma":[0.00001279465,0.000195679,0.00007265621,0.0003223117,0.00007923653,0.0002786582,0.00006968318,0.0002071727,0.0001240111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705536,"about_ca_system_score_gemma":0.00001975108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001229889,"about_ca_topic_score_gemma":0.00002822206,"domain_scores_codex":[0.9983056,0.00008625173,0.0003406924,0.0005552261,0.0003287888,0.000383449],"domain_scores_gemma":[0.9988524,0.000122996,0.0001004847,0.000710166,0.0000748741,0.0001390496],"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.00006449432,0.0004817835,0.0001803336,0.00004408807,0.00009642755,0.0000171655,0.00249092,0.002150741,0.004152562,0.007331368,0.007555657,0.9754345],"study_design_scores_gemma":[0.003445032,0.001464664,0.002869541,0.000357046,0.00003672579,0.0001522096,0.0003921084,0.871937,0.002369508,0.003118903,0.1125404,0.001316819],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03575803,0.0001324722,0.961513,0.0009839515,0.0005734579,0.0001849077,0.000009900579,0.0002685195,0.0005757348],"genre_scores_gemma":[0.9406738,0.00001896744,0.05852177,0.0004939002,0.00010909,0.000008461006,0.000005801303,0.00001182653,0.0001564012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9741176,"threshold_uncertainty_score":0.7979558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01568523912858472,"score_gpt":0.257209062302438,"score_spread":0.2415238231738532,"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."}}