{"id":"W2090209978","doi":"10.1007/s10766-009-0094-9","title":"A Speculative and Adaptive MPI Rendezvous Protocol Over RDMA-enabled Interconnects","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; InfiniBand; Rendezvous; Message passing; Computer network; Message Passing Interface; Latency (audio); Protocol (science); Distributed computing; Overhead (engineering); Parallel computing; Operating system","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.0005021599,0.000185187,0.0002504751,0.0003262573,0.00007664068,0.0004057412,0.0009439045,0.00006909328,0.000009920126],"category_scores_gemma":[0.0001373177,0.0001574392,0.0001243931,0.0001968588,0.00004960144,0.00087254,0.0001763803,0.0002838408,0.000002592151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072568,"about_ca_system_score_gemma":0.00009698631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008973088,"about_ca_topic_score_gemma":0.000002068151,"domain_scores_codex":[0.9982761,0.0001026795,0.0005740048,0.0002585089,0.0005550493,0.0002337149],"domain_scores_gemma":[0.9983338,0.00008814267,0.0006450443,0.000163336,0.0006448529,0.0001247994],"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.0008365454,0.0008115558,0.001282359,0.00001941068,0.0004974028,0.001025991,0.004522214,0.01107671,0.0005804415,0.1247183,0.002912882,0.8517162],"study_design_scores_gemma":[0.01570895,0.00915749,0.01932574,0.001987329,0.00008380569,0.004673509,0.0005023158,0.6658526,0.004805865,0.183256,0.09242371,0.002222692],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002008315,0.00005667757,0.9915174,0.001127329,0.0002133575,0.003589194,5.021566e-7,0.0001297759,0.001357398],"genre_scores_gemma":[0.4786592,0.000009238586,0.5203756,0.000340194,0.0002056706,0.0003155883,7.30731e-7,0.000007891999,0.00008592808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8494935,"threshold_uncertainty_score":0.6420185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02013553902287299,"score_gpt":0.316397548544232,"score_spread":0.296262009521359,"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."}}