{"id":"W2971516936","doi":"10.1016/j.parco.2019.102547","title":"A dynamic, unified design for dedicated message matching engines for collective and point-to-point communications","year":2019,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Government of Ontario; University of Toronto; Canada Foundation for Innovation; Ontario Research Foundation; U.S. Department of Energy","keywords":"Message queue; Computer science; Queue; Point-to-point; Message passing; Message Passing Interface; Scalability; Speedup; Computer network; Distributed computing; Matching (statistics); Priority queue; Queueing theory; Point (geometry); Parallel computing; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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.001232367,0.0009472553,0.001188259,0.001273348,0.001182048,0.002897072,0.004974045,0.001073996,0.005412206],"category_scores_gemma":[0.002140663,0.0007457244,0.0007801013,0.0009682503,0.0006862833,0.002628815,0.001910157,0.001475355,0.002930907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001526589,"about_ca_system_score_gemma":0.002792362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002090457,"about_ca_topic_score_gemma":0.003342063,"domain_scores_codex":[0.9985672,0.000163417,0.0001259318,0.0003535025,0.000521689,0.0002681791],"domain_scores_gemma":[0.9984869,0.0002097723,0.0001540501,0.0004832865,0.0005559973,0.000110007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001474173,0.0009351254,0.003155436,0.0008773467,0.0003951017,0.0003476912,0.0005193985,0.1671531,0.2057055,0.1214965,0.02795315,0.4699874],"study_design_scores_gemma":[0.0001303696,0.0006445932,0.0005478649,0.00006571405,0.0002584014,0.0002758006,0.0001143915,0.7885597,0.1498557,0.01893619,0.04050291,0.0001082405],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01812739,0.0005292419,0.9692762,0.0001571639,0.0001728262,0.0002606226,0.0001115116,0.006361722,0.00500324],"genre_scores_gemma":[0.4547162,0.0004596098,0.5314007,0.0003781116,0.0001430254,0.0005497173,0.0005646318,0.0008245252,0.01096345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005412206,"threshold_uncertainty_score":0.01810557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02755589818956545,"score_gpt":0.2919306506323945,"score_spread":0.264374752442829,"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."}}