{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142588,0.0004371791,0.0005642163,0.0005182926,0.001159152,0.001537493,0.003929048,0.0008981396,0.001000254],"category_scores_gemma":[0.002868479,0.0004106994,0.0003987325,0.0006602857,0.0008705631,0.003040319,0.002922912,0.001446231,0.0002737058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000758219,"about_ca_system_score_gemma":0.001063428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007164255,"about_ca_topic_score_gemma":0.001133741,"domain_scores_codex":[0.9990281,0.0002481767,0.00008233453,0.0001407323,0.0003940849,0.0001066415],"domain_scores_gemma":[0.9976561,0.0003109087,0.0002347992,0.001235139,0.0003739776,0.0001890627],"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.001136704,0.0003769177,0.006185973,0.001017983,0.0003992211,0.001165848,0.00245065,0.1547233,0.2126385,0.1942337,0.01166188,0.4140092],"study_design_scores_gemma":[0.0002674285,0.00107868,0.001581751,0.00009769621,0.0003386336,0.001553035,0.000687545,0.6765749,0.1237398,0.1007639,0.0931341,0.0001825421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08431542,0.0008312349,0.9084174,0.0006311763,0.0001633725,0.0001893082,0.00004611157,0.002412159,0.002993786],"genre_scores_gemma":[0.7376959,0.0004803469,0.2575916,0.0002449392,0.0001507523,0.0002435862,0.0001133517,0.0001567425,0.003322879],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003929048,"threshold_uncertainty_score":0.007540822,"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."}}