{"id":"W2063992960","doi":"10.1007/s00446-011-0150-8","title":"RMR-efficient implementations of comparison primitives using read and write operations","year":2011,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Swap (finance); Asynchronous communication; Shared memory; Reading (process); Constant (computer programming); Distributed shared memory; Cache; Implementation; Programming language; Uniform memory access; Memory management; Overlay; 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.000318955,0.0001592405,0.0002844816,0.0000852308,0.0003393638,0.0001186566,0.0004089652,0.00004822131,0.0000112348],"category_scores_gemma":[0.00003726454,0.0001606152,0.00005648439,0.0005148532,0.00008651978,0.0001839341,0.0002127437,0.000109414,0.00000252252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004306562,"about_ca_system_score_gemma":0.0000617581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003106795,"about_ca_topic_score_gemma":0.00001176544,"domain_scores_codex":[0.9983964,0.00009620574,0.0006168203,0.0003702117,0.0002047743,0.0003155921],"domain_scores_gemma":[0.9990048,0.00006975007,0.0002082771,0.0003760142,0.0002387598,0.0001024072],"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.00003084481,0.001637405,0.1022535,0.0002548633,0.0003315961,0.00003619913,0.0284223,0.157733,0.01483273,0.6206006,0.0005316175,0.07333537],"study_design_scores_gemma":[0.00037772,0.00005225014,0.03522395,0.00009526396,0.00001723325,0.00001777697,0.0009404147,0.9604916,0.002231869,0.00009873525,0.0002553143,0.0001978525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2965812,0.0001513072,0.7024087,0.00002453921,0.0001176817,0.0001659389,0.0001865638,0.00007203523,0.0002919628],"genre_scores_gemma":[0.9388443,0.000002227875,0.06099318,0.00002026265,0.00002274105,0.000003741978,0.0001047425,0.000006582068,0.000002233131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8027586,"threshold_uncertainty_score":0.6549699,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07288501185737015,"score_gpt":0.317959051691344,"score_spread":0.2450740398339739,"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."}}