{"id":"W2103466822","doi":"10.1109/shpcc.1994.296619","title":"An efficient single copy cache coherence protocol for multiprocessors with multistage interconnection networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Cache coherence; MESI protocol; Interconnection; Cache; MESIF protocol; Parallel computing; Protocol (science); Shared memory; Bus sniffing; Multiprocessing; Scalability; Overhead (engineering); Distributed shared memory; Distributed computing; Multistage interconnection networks; Computer network; Cache algorithms; CPU cache; Memory management; Uniform memory access; Operating system; Overlay","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.0005959765,0.0002342242,0.0002405059,0.0003687919,0.0005733575,0.0004758979,0.0009014205,0.0004755246,0.001224051],"category_scores_gemma":[0.001881991,0.0001851237,0.0001746764,0.0004925482,0.0004063263,0.001449529,0.0006579737,0.0004210086,0.0001436836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005030979,"about_ca_system_score_gemma":0.0008564673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002050109,"about_ca_topic_score_gemma":0.004555205,"domain_scores_codex":[0.9995362,0.0001245533,0.00003974105,0.0000470065,0.0002132569,0.00003923538],"domain_scores_gemma":[0.9993261,0.0001962728,0.00008038222,0.0001848755,0.0001818032,0.00003050761],"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.0009943516,0.0003899875,0.003152578,0.0006045325,0.0001890885,0.0008036692,0.0008112701,0.3027179,0.1937225,0.07007707,0.01647124,0.4100659],"study_design_scores_gemma":[0.0002361552,0.0007821191,0.001218401,0.00002365906,0.00008297783,0.0003548129,0.00009762587,0.921937,0.04920686,0.01092855,0.01507227,0.00005949912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1857689,0.0009486929,0.8053746,0.0007124866,0.0001135517,0.0003464478,0.0001868007,0.001765854,0.004782652],"genre_scores_gemma":[0.8546995,0.0003479219,0.1396157,0.0001340287,0.00004104406,0.0003358107,0.0003230493,0.00005068941,0.004452211],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002050109,"threshold_uncertainty_score":0.004094839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04349961911352836,"score_gpt":0.2811499781452271,"score_spread":0.2376503590316988,"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."}}