{"id":"W2093197865","doi":"10.1007/s00446-005-0145-4","title":"Relationships between broadcast and shared memory in reliable anonymous distributed systems","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Asynchronous communication; Atomic broadcast; Shared memory; Identifier; Robustness (evolution); Distributed computing; Distributed shared memory; Computer network; Broadcasting (networking); Parallel computing; Memory management; Operating system; Uniform memory access","routes":{"ca_aff":true,"ca_fund":true,"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.005400278,0.0004309186,0.001064134,0.001873984,0.00294865,0.00614255,0.002115626,0.002498858,0.006443531],"category_scores_gemma":[0.06128152,0.001075285,0.0004470682,0.002829255,0.004918782,0.01556091,0.003034099,0.003130679,0.0006692082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961997,"about_ca_system_score_gemma":0.001548168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103733,"about_ca_topic_score_gemma":0.00165786,"domain_scores_codex":[0.9958971,0.002116637,0.0002088112,0.000461338,0.0009607723,0.0003553956],"domain_scores_gemma":[0.9199609,0.066146,0.004932876,0.00415566,0.003632027,0.001172572],"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.000408078,0.0000685193,0.001314987,0.0001447647,0.00002739866,0.0001333638,0.001302774,0.01525289,0.0005171849,0.9557678,0.002746441,0.02231572],"study_design_scores_gemma":[0.00008149913,0.00006106739,0.0004607906,0.00004155928,0.000073739,0.0001719203,0.0004021144,0.05822583,0.0007780864,0.9335372,0.00613647,0.00002961024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2563055,0.01210598,0.6617668,0.009982339,0.0005374189,0.0001644634,0.0004088974,0.0007699408,0.05795867],"genre_scores_gemma":[0.9611552,0.00216449,0.02750044,0.0003127855,0.0006068801,0.0001477817,0.000152581,0.0001572096,0.007802579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006443531,"threshold_uncertainty_score":0.0285598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257461129592839,"score_gpt":0.2450974354943919,"score_spread":0.219351322535108,"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."}}