• Home
• People
• Jobs
• Visit
• Thesis Topics
• Publications
• Conference Rankings
• Research
• Bcast
• Teaching
• Contact

SPONSORS

COLLABORATIONS

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

J. S. Garcia, S. Di Girolamo, S. Kosta, J. Vegas Olmos, R. Nudelman, T. Hoefler, G. Bloch:
	Offloaded MPI message matching: an optimistic approach (Vol , Nr. , In SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis, pages 457-469, ISSN: , 2024) Publisher Reference Abstract 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. Documents access preprint on arxiv:
	BibTeX
@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},   month={},   pages={457-469},   volume={},   number={},   booktitle={SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis},   issn={},   doi={10.1109/SCW63240.2024.00067}, }