Contention-free communication scheduling on 2D meshes

Spontaneous, unorchestrated communications on message-passing multicomputers can cause collision, buffer overflow, and even deadlock, resulting in high communication overhead and reduced overall performance. We present scheduling algorithms for frequently-used communication patterns, such as shifting, transposition, and rotation, on mesh networks. The schedules generated by the algorithms are contention-free and are optimal with respect to the number of message-passing steps. The scheduling algorithms incur little runtime overhead, since they do not require global information exchange. Simulation results confirm that the scheduling algorithms are effective in reducing communication cost