{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088679,0.001682087,0.00183363,0.001896747,0.001417317,0.003755416,0.005996076,0.00171299,0.01990307],"category_scores_gemma":[0.01138543,0.001385556,0.001006345,0.003001766,0.001399044,0.007983651,0.003385786,0.002203389,0.007874102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948413,"about_ca_system_score_gemma":0.002370399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00124292,"about_ca_topic_score_gemma":0.002592724,"domain_scores_codex":[0.9936962,0.001956582,0.0005851079,0.0008531021,0.002071438,0.0008375931],"domain_scores_gemma":[0.9878127,0.003187015,0.0008175625,0.006465895,0.001411275,0.0003055413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004019241,0.000687263,0.001773539,0.0008883213,0.0001923349,0.0003878738,0.0005828799,0.02090024,0.09978031,0.1152575,0.04372182,0.7118086],"study_design_scores_gemma":[0.001653821,0.001083805,0.001731001,0.0002345636,0.0003284221,0.001003948,0.0003923061,0.5037284,0.3096986,0.117695,0.06204768,0.0004024483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05261527,0.001535063,0.8782443,0.0004771105,0.0004490906,0.000362651,0.0005490288,0.05053958,0.01522793],"genre_scores_gemma":[0.3988683,0.0003351977,0.5772398,0.0004629607,0.0002674249,0.0005119728,0.001342167,0.004219066,0.01675312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01990307,"threshold_uncertainty_score":0.06658238,"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."}}