{"id":"W2166252726","doi":"10.1109/hpca.2003.1183538","title":"Dynamic data replication: an approach to providing fault-tolerant shared memory clusters","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Replication (statistics); Distributed shared memory; Latency (audio); Protocol (science); Fault tolerance; Data diffusion machine; Overhead (engineering); Low latency (capital markets); Computer network; Virtual memory; Operating system; Memory management; Overlay; Uniform memory access","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.0009388849,0.000194897,0.0002312628,0.00007731116,0.0001978626,0.0004866655,0.002876102,0.00007169379,0.00001107749],"category_scores_gemma":[0.00008839738,0.0001710238,0.00003534324,0.0006148333,0.00002030361,0.001537612,0.0004046654,0.0001152934,0.00007974702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007441627,"about_ca_system_score_gemma":0.0001047588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006413003,"about_ca_topic_score_gemma":0.00002126888,"domain_scores_codex":[0.9973103,0.0001249368,0.0003933309,0.00142391,0.0003618464,0.0003856262],"domain_scores_gemma":[0.9945093,0.0000242246,0.0001013327,0.004999963,0.0001061124,0.0002590803],"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.00008375342,0.003234372,0.0007676094,0.0006802779,0.0002688326,0.00008218427,0.0147347,0.04142091,0.009594997,0.4524265,0.1386693,0.3380366],"study_design_scores_gemma":[0.0003200888,0.00003570169,0.0003078274,0.00002452927,0.000004284759,0.0000615776,0.0003326226,0.9596005,0.0001462547,0.00009446049,0.03874674,0.0003253968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002649523,0.00007370987,0.9621381,0.0006063157,0.0002856151,0.0006408255,0.00005374991,0.0003497075,0.03320244],"genre_scores_gemma":[0.7470056,0.000001741528,0.2496096,0.0009722901,0.00003198555,0.0000958675,0.0002511609,0.00001814805,0.002013569],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9181796,"threshold_uncertainty_score":0.6974147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05101440513361539,"score_gpt":0.2949219372126086,"score_spread":0.2439075320789932,"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."}}