Analysis of deadlock-free path-based wormhole multicasting in meshes in case of contentions

Multicasting is an information dissemination problem which consists, for a processor of a distributed memory parallel computer, to send the same message to a subset of processors. In this paper we revisit our multicasting algorithms for the mesh, and using wormhole routing with the path-based facility. We have shown that our algorithms perform generally faster than algorithms previously described in the literature under the same model. This was shown analytically, and experimentally. However the analysis was mainly performed in absence of contention due to other traffic (possibly other multicasts). In this paper, we complete the analysis, and we show that our algorithms perform efficiently even if the network is heavily loaded