{"id":"W1991558558","doi":"10.1007/s00446-015-0261-8","title":"Universal constructions that ensure disjoint-access parallelism and wait-freedom","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disjoint sets; Computer science; Parallelism (grammar); Parallel computing; Data parallelism; Task parallelism; Crash; Degrees of freedom (physics and chemistry); Base (topology); Process (computing); Distributed computing; Programming language; Mathematics","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.006261159,0.001342862,0.002514919,0.001455763,0.004901464,0.005312399,0.003753002,0.002613401,0.00666745],"category_scores_gemma":[0.02623344,0.002238306,0.002673709,0.002689329,0.009840058,0.01695075,0.01703569,0.009264467,0.001672999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002407887,"about_ca_system_score_gemma":0.003405311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009090218,"about_ca_topic_score_gemma":0.001162095,"domain_scores_codex":[0.9922509,0.001446018,0.0006252603,0.001738442,0.001812854,0.00212661],"domain_scores_gemma":[0.9702324,0.01182264,0.001526671,0.01283769,0.001789088,0.001791463],"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.0001190909,0.00005277071,0.0002315183,0.00008077504,0.00001807242,0.00004306663,0.0004800253,0.002246739,0.001767082,0.9834238,0.001677751,0.009859366],"study_design_scores_gemma":[0.00006581372,0.00003061682,0.00008883781,0.0000357705,0.00006762485,0.00006864834,0.00008991758,0.009442411,0.005140097,0.9791527,0.005775709,0.00004181332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04724572,0.0003495073,0.9295985,0.001301153,0.0002861,0.0001551398,0.0002268616,0.003793714,0.01704345],"genre_scores_gemma":[0.7870108,0.0004612867,0.1977201,0.001360983,0.0003691289,0.0005091628,0.0003562807,0.002016015,0.01019623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00666745,"threshold_uncertainty_score":0.03311253,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01891117604027799,"score_gpt":0.2416308932677721,"score_spread":0.2227197172274941,"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."}}