{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009178271,0.0007994213,0.00100542,0.0006987243,0.0008809071,0.001543516,0.002464755,0.001071325,0.002850125],"category_scores_gemma":[0.004480927,0.0004320535,0.001019924,0.001277308,0.001440285,0.00280737,0.002823009,0.001978047,0.0009129368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009782121,"about_ca_system_score_gemma":0.002196061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003654418,"about_ca_topic_score_gemma":0.002112276,"domain_scores_codex":[0.998793,0.0002858601,0.00006729357,0.0002072029,0.0004656445,0.0001809978],"domain_scores_gemma":[0.9989529,0.0003331418,0.0001465186,0.000260317,0.0002362137,0.00007085798],"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.0003073076,0.00006542188,0.0009416709,0.000558103,0.00008206658,0.0004295354,0.000617013,0.2778598,0.01305269,0.5813425,0.008489822,0.1162542],"study_design_scores_gemma":[0.00007092652,0.00006041372,0.0002118416,0.0000385273,0.00004766542,0.0002076925,0.00006565513,0.8453571,0.005500619,0.1240285,0.02437564,0.00003555966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00955178,0.0007397265,0.9830999,0.0003163381,0.000146851,0.00009584059,0.00007150614,0.0008922384,0.005085836],"genre_scores_gemma":[0.4368332,0.001870833,0.5451009,0.0002663686,0.0002510385,0.000467615,0.0004326412,0.0006993909,0.01407795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003654418,"threshold_uncertainty_score":0.009534597,"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."}}