An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors
✍ Scribed by M.P. Malumbres; José Duato
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 398 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1383-7621
No coin nor oath required. For personal study only.
✦ Synopsis
This paper presents an ecient routing and ¯ow control mechanism to implement multidestination message passing in wormhole networks. The mechanism is a variation of tree-based multicast with pruning to recover from deadlocks and it is well suited for distributed shared-memory multiprocessors (DSMs) with hardware cache coherence. It does not require any preprocessing of multicast messages reducing notably the software overhead required to send a multicast message. Also, it allows messages to use any deadlock-free routing function. The new scheme has been evaluated by simulation using synthetic loads. It achieves multicast latency reductions of 30% on average. Also it was compared with other multicast mechanisms proving its bene®ts. Finally, it can be easily implemented in hardware with minimal changes to existing unicast wormhole routers.