Message matching is a critical process ensuring the correct delivery of messages in distributed and HPC environments. The advent of SmartNICs presents an opportunity to develop offloaded message-matching approaches that leverage this on-NIC programmable accelerator, retaining the flexibility of software-based solutions (e.g., tailoring to application matching behaviors or specialization for non-MPI matching semantics) while freeing up CPU resources. This can be especially beneficial for intensive I/O systems, such as those protected with PQC. In this work, we propose a bin-based MPI message approach, Optimistic Tag Matching, explicitly designed for the lightweight, highly parallel architectures typical of on-path SmartNICs. We analyze several MPI applications, showing how most of them present a matching behavior suitable for offloading with the proposed strategy (i.e., low queue depths). Additionally, we show how, in those scenarios, offloaded optimistic matching maintains message rates comparable to traditional on-CPU MPI message matching while freeing up CPU resources.
@article{, author={Jerónimo S. Garcia and Salvatore Di Girolamo and Sokol Kosta and J.J. Vegas Olmos and Rami Nudelman and Torsten Hoefler and Gil Bloch}, title={{Offloaded MPI message matching: an optimistic approach}}, year={2024}, pages={457-469}, booktitle={SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis}, source={http://www.unixer.de/~htor/publications/}, }
