The HPC literature includes many collective algorithms optimized for specific network topologies and message sizes. Based on the message size, MPI implementations might choose completely different communication algorithms to efficiently utilize bandwidth on large messages and hide the latency for small messages, e.g., with pipelining.
We want to evaluate how such algorithms can be ported to serverless communication.
The HPC literature includes many collective algorithms optimized for specific network topologies and message sizes. Based on the message size, MPI implementations might choose completely different communication algorithms to efficiently utilize bandwidth on large messages and hide the latency for small messages, e.g., with pipelining.
We want to evaluate how such algorithms can be ported to serverless communication.