Analysis of deadlock-free path-based wormhole multicasting in meshes in case of contentions
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
| Hi-index | 0.00 |
This paper presents new multicasting algorithms for the mesh under the wormhole routing mode and using the read-and-route facility. These new algorithms perform generally faster than the algorithms previously described in the literature under the same model. We take, as criteria to compare the algorithms, the off-line computation time necessary to prepare the multicast, and the communication time to complete the multicast in absence of traffic. Moreover, since it is often not possible to derive useful expression for the communication time, we also simulate the algorithms.