{"id":"W2166416865","doi":"10.1109/icdcs.1994.302398","title":"An efficient method for mutual exclusion in truly distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Computer science; Correctness; Tree (set theory); Distributed algorithm; Overhead (engineering); Distributed computing; Suzuki-Kasami algorithm; Mutual information; Voting; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598213,0.00064027,0.0006922636,0.0009578614,0.001310832,0.001820381,0.001723791,0.001144395,0.006608828],"category_scores_gemma":[0.0048301,0.0004519506,0.0006527282,0.0008776961,0.001099622,0.002822081,0.002733902,0.001522021,0.002445381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000791162,"about_ca_system_score_gemma":0.001374819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005372165,"about_ca_topic_score_gemma":0.0008381024,"domain_scores_codex":[0.9975359,0.0006451394,0.0001462354,0.0003109978,0.001190402,0.0001712425],"domain_scores_gemma":[0.9981882,0.0005812415,0.00009771036,0.0006612265,0.0003803213,0.00009135305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002289253,0.0001225762,0.0004035329,0.0003597275,0.00008040535,0.0003804012,0.0005068324,0.04304726,0.02580821,0.5243621,0.02632806,0.3783719],"study_design_scores_gemma":[0.0002757999,0.000242376,0.0002782017,0.00009479964,0.00007417868,0.0007800501,0.0001046193,0.4539602,0.02387885,0.2740323,0.2461834,0.00009531746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001430254,0.0001565648,0.9936665,0.000171421,0.0001139663,0.00009863303,0.00002833224,0.000961664,0.003372733],"genre_scores_gemma":[0.115636,0.000430816,0.864572,0.0003685954,0.0002709963,0.0008443053,0.0002346343,0.0005070402,0.01713556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006608828,"threshold_uncertainty_score":0.02210867,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02318509445989404,"score_gpt":0.2860185086874513,"score_spread":0.2628334142275573,"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."}}