{"id":"W2885177983","doi":"10.1109/ipdpsw.2018.00124","title":"Barrier Synchronization: Simplified, Generalized, and Solved Without Mutual Exclusion","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Synchronization (alternating current); Bulk synchronous parallel; Correctness; Parallel computing; Distributed computing; Mutual exclusion; Concurrency; Parallel algorithm; Concurrent computing; Shared memory; Component (thermodynamics); Node (physics); Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743627,0.0001298569,0.0001535726,0.0000393779,0.0002692101,0.0002317953,0.0003567398,0.00007103978,0.0001369155],"category_scores_gemma":[0.00001986643,0.0001037887,0.00002600189,0.0002322913,0.00009479139,0.0004125563,0.0002714581,0.00005070982,0.0001468959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000216202,"about_ca_system_score_gemma":0.00004834308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005287281,"about_ca_topic_score_gemma":0.00004404887,"domain_scores_codex":[0.9989158,0.00003959438,0.0002069333,0.0003858373,0.0002133873,0.0002384285],"domain_scores_gemma":[0.9991998,0.00001636434,0.00005730222,0.0004307075,0.0001585322,0.0001372944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008592937,0.0001930532,0.02182674,0.0001081807,0.0001152528,0.0000544552,0.005063419,0.0001376362,0.01562835,0.6146649,0.1195788,0.2225433],"study_design_scores_gemma":[0.001723716,0.0002296471,0.002873546,0.00005386803,0.000009341714,0.0001092362,0.00007875499,0.7874307,0.00342838,0.002171428,0.2013052,0.0005862354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03496996,0.0001423408,0.9532083,0.0003866033,0.0004654072,0.0001409958,0.00000544556,0.0001882422,0.01049271],"genre_scores_gemma":[0.9790158,0.00001172809,0.01691424,0.0006874412,0.0003280413,0.000007959258,0.000006064696,0.000007987879,0.003020707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9440458,"threshold_uncertainty_score":0.423238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01196423974868089,"score_gpt":0.2490100015682273,"score_spread":0.2370457618195464,"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."}}