{"id":"W2020165959","doi":"10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Concurrency; Computer science; Asynchronous communication; Generalization; Critical section; Algorithm; Group (periodic table); Process (computing); Suzuki-Kasami algorithm; Extension (predicate logic); Theoretical computer science; Distributed computing; Mathematics; Programming language; Computer network","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.001055863,0.000619784,0.0007788609,0.0005275352,0.001187132,0.001048074,0.002204278,0.001313262,0.005479363],"category_scores_gemma":[0.002355669,0.0003153684,0.0004102147,0.0008049534,0.0006149706,0.00145394,0.002145329,0.0009129324,0.001487667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007176638,"about_ca_system_score_gemma":0.001503087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00159247,"about_ca_topic_score_gemma":0.001926023,"domain_scores_codex":[0.9989179,0.0002480112,0.00005899739,0.0002014103,0.0004110094,0.0001626111],"domain_scores_gemma":[0.9989311,0.000354262,0.00008856944,0.0002613407,0.0002574804,0.0001071837],"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.000842394,0.0004764258,0.001464771,0.0002311583,0.00008804229,0.0003442747,0.0003675327,0.3061672,0.01990176,0.1095911,0.01872341,0.5418019],"study_design_scores_gemma":[0.0002231972,0.0001179058,0.0001493164,0.00001319739,0.00001989688,0.0001769946,0.00002835767,0.9314303,0.005066494,0.04590629,0.01684564,0.00002238421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01105508,0.0001515416,0.9817837,0.0002454994,0.00006547428,0.0001380656,0.00006201475,0.001379145,0.005119339],"genre_scores_gemma":[0.2212637,0.0001292346,0.768684,0.0002197251,0.00006985676,0.0002782973,0.0002475985,0.0001701939,0.008937416],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005479363,"threshold_uncertainty_score":0.01833028,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008804448669416143,"score_gpt":0.2258978333368807,"score_spread":0.2170933846674646,"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."}}