| Autor: |
Groves, Taylor, Ravichandrasekaran, Naveen, Cook, Brandon, Keen, Noel, Trebotich, David, Wright, Nicholas J., Alverson, Bob, Roweth, Duncan, Underwood, Keith |
| Předmět: |
|
| Zdroj: |
Concurrency & Computation: Practice & Experience; 7/10/2023, Vol. 35 Issue 15, p1-9, 9p |
| Abstrakt: |
Summary: Message matching within MPI is an important performance consideration for applications that utilize two‐sided semantics. In this work, we present an instrumentation of the CrayMPI library that allows the collection of detailed message‐matching statistics as well as an implementation of hashed matching in software. We use this functionality to profile key DOE applications with complex communication patterns to determine under what circumstances an application might benefit from hardware offload capabilities within the NIC to accelerate message matching. We find that there are several applications and libraries that exhibit sufficiently long match list lengths to motivate a Binned Message Matching approach. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text