{"id":"W2044274432","doi":"10.1145/1147349.1147358","title":"Hiding message delivery and reducing memory access latency by providing direct-to-cache transfer during receive operations in a message passing environment","year":2005,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Copying; Cache invalidation; Message passing; Latency (audio); Computer network; Thread (computing); Cache pollution; False sharing; Cache algorithms; Bus sniffing; CPU cache; Distributed computing; Parallel computing; Operating system; Telecommunications","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005819775,0.0004404343,0.0004572997,0.000577675,0.0004715291,0.0007207613,0.001759041,0.0001362168,0.00001251257],"category_scores_gemma":[0.00007032014,0.0004274758,0.00009353508,0.0005887595,0.00006816315,0.0009071191,0.001579282,0.0006244183,0.000008206647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002317151,"about_ca_system_score_gemma":0.00007847601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001769282,"about_ca_topic_score_gemma":0.00007606439,"domain_scores_codex":[0.9965651,0.0004442789,0.0006295884,0.001214304,0.0004371005,0.00070962],"domain_scores_gemma":[0.9983484,0.000347109,0.00006653277,0.0009211306,0.0000422099,0.000274665],"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.00002405634,0.0001289889,0.0005891035,0.00005887637,0.00003976247,0.00003379392,0.01224637,0.6785186,0.02203018,0.00005162414,0.0007096359,0.285569],"study_design_scores_gemma":[0.001763622,0.0002530038,0.003779387,0.0007941432,0.00002972541,0.0001097525,0.00005190894,0.9088737,0.07910317,0.0003965293,0.003416731,0.001428348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2769884,0.0003676029,0.7169858,0.004237403,0.00008404788,0.0006441275,0.000003913061,0.0003466985,0.000342027],"genre_scores_gemma":[0.6328806,0.0001680655,0.3659161,0.0006496515,0.0001707452,0.00005486244,0.000006987192,0.00003541032,0.0001176252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3558922,"threshold_uncertainty_score":0.9998177,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01371884196843408,"score_gpt":0.2461404159929009,"score_spread":0.2324215740244668,"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."}}