{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003349949,0.0002384645,0.0002259131,0.00008903662,0.0002772759,0.0004248307,0.0005856244,0.0001166763,0.0001105109],"category_scores_gemma":[0.00002234107,0.0001733148,0.00006775606,0.000357958,0.00005031861,0.0004700375,0.00004861086,0.0001513572,0.00002020996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001008574,"about_ca_system_score_gemma":0.00001317861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008510771,"about_ca_topic_score_gemma":0.0003038674,"domain_scores_codex":[0.9982386,0.00009738436,0.0003717122,0.0006426157,0.0002198771,0.0004298046],"domain_scores_gemma":[0.9986985,0.000131707,0.0001878043,0.0005338252,0.0003002415,0.0001478942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000360652,0.002391489,0.001311292,0.0002322171,0.00007814974,0.00002183842,0.003828659,0.9210092,0.001386437,0.01235443,0.009361328,0.04766428],"study_design_scores_gemma":[0.00146749,0.001318184,0.0000350367,0.00009617587,0.000003308095,0.00003654214,0.0001677477,0.988834,0.001766866,0.00001429201,0.005973618,0.0002867063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001999511,0.000004033338,0.943777,0.00007545949,0.0003289083,0.05147099,0.000001221304,0.000406656,0.001936258],"genre_scores_gemma":[0.8640797,1.010371e-7,0.02183408,0.0001885161,0.0001942654,0.1125633,0.000001646763,0.00002186995,0.001116588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9219429,"threshold_uncertainty_score":0.7067574,"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."}}