Network-Accelerated Non-Contiguous Memory Transfers

Abstract

Applications often communicate data that is non-contiguous in the send- or the receive-buffer, e.g., when exchanging a column of a matrix stored in row-major order. While non-contiguous transfers are well supported in HPC (e.g., MPI derived datatypes), they can still be up to 5x slower than contiguous transfers of the same size. As we enter the era of network acceleration, we need to investigate which tasks to offload to the NIC: In this work we argue that non-contiguous memory transfers can be transparently networkaccelerated, truly achieving zero-copy communications. We implement and extend sPIN, a packet streaming processor, within a Portals 4 NIC SST model, and evaluate strategies for NIC-offloaded processing of MPI datatypes, ranging from datatype-specific handlers to general solutions for any MPI datatype. We demonstrate up to 10x speedup in the unpack throughput of real applications, demonstrating that non-contiguous memory transfers are a first-class candidate for network acceleration.

In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC19), Nov. 2019

References in corpus (1)

• HERO: Heterogeneous Embedded Research Platform for Exploring RISC-V Manycore Accelerators on FPGA

Cited by in corpus (5)

• Demystifying Chains, Trees, and Graphs of Thoughts
• Slim Fly: A Cost Effective Low-Diameter Network Topology
• Substream-Centric Maximum Matchings on FPGA
• EvalNet: A Practical Toolchain for Generation and Analysis of Extreme-Scale Interconnects
• Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations