.png){kind=icon}
.png){kind=icon}
Return
An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors
.png){kind=icon}
PRE
AI
DOI：10.1016/S1383-7621(00)00007-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an efficient routing and flow 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 benefits. Finally, it can be easily implemented in hardware with minimal changes to existing unicast wormhole routers. (C) 2000 Elsevier Science B.V. All rights reserved.
Keywords:
interconnection networks
wormhole switching
tree-based multicast
adaptive routing
distributed shared-memory multiprocessors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
3.0K
Citations:
4.2K
Organization
No organization information available