An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors

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 (DSM...

Full description

Saved in:
Bibliographic Details
Published in:Journal of systems architecture Vol. 46; no. 11; pp. 1019 - 1032
Main Authors: Malumbres, M.P., Duato, José
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.09.2000
Elsevier
Elsevier Sequoia S.A
Subjects:
Adaptive routing
Applied sciences
Computer networks
Computer systems
Distributed shared memory
Distributed shared-memory multiprocessors
Electronics
Exact sciences and technology
Flow control
Hardware
Interconnected networks
Interconnection networks
Multiprocessing
Networks and services in france and abroad
Routing
Switching
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Tree-based multicast
Wormhole switching
Tree-based multicast
Adaptive routing
Distributed shared-memory multiprocessors
Interconnection networks
Wormhole switching
Deadlock
Multicast
Multiprocessor
Distributed memory
Interconnection network
Wormhole
Tree(graph)
Computer hardware
Routing
Shared memory
Message transmission
ISSN:1383-7621, 1873-6165
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1383-7621
1873-6165
DOI:10.1016/S1383-7621(00)00007-2