{"id":"W1987782288","doi":"10.1145/1374376.1374410","title":"Tight RMR lower bounds for mutual exclusion and other problems","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Rocky Mountain Research Station","keywords":"Mutual exclusion; Computer science; Asynchronous communication; Encoding (memory); Shared memory; Upper and lower bounds; Synchronization (alternating current); Parallel computing; Concurrency; Bounded function; Reading (process); Conjecture; Class (philosophy); Cache coherence; Theoretical computer science; Cache; CPU cache; Order (exchange); Discrete mathematics; Distributed computing; Mathematics; 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.0001268657,0.00009377681,0.0001187045,0.00002717382,0.0002014695,0.00008277865,0.0002507767,0.00005141458,0.00002237985],"category_scores_gemma":[0.000006653353,0.00006934929,0.00003710129,0.0001151213,0.00004438052,0.0002301739,0.00007211651,0.00003766015,0.0000310774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197328,"about_ca_system_score_gemma":0.00002709615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003869074,"about_ca_topic_score_gemma":0.00001698092,"domain_scores_codex":[0.9992219,0.00001169048,0.0001531224,0.0002738724,0.0001403707,0.0001990901],"domain_scores_gemma":[0.9995602,0.0000266162,0.0000397799,0.0002530007,0.0000505396,0.00006984701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008186802,0.0007825206,0.009512359,0.0002678001,0.00009517057,0.00007813448,0.008337351,0.0001829687,0.01095154,0.4821408,0.4360497,0.05151979],"study_design_scores_gemma":[0.0006796123,0.0001517207,0.0007894657,0.00002735626,0.000001645501,0.00008222116,0.00001069875,0.03546579,0.0004783179,0.0009639594,0.9611464,0.0002028209],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03278456,0.0002610614,0.9455004,0.0005179943,0.0004454796,0.0003436885,0.00001378364,0.0001514944,0.01998156],"genre_scores_gemma":[0.9767141,0.000009792875,0.009827361,0.0006371947,0.0001068155,0.00003912727,0.000002329824,0.000009220633,0.01265406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9439296,"threshold_uncertainty_score":0.2827982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02553064880310718,"score_gpt":0.2379874146707169,"score_spread":0.2124567658676098,"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."}}