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

Malumbres, Manuel P.; Duato, José; Torrellas, Josep

doi:10.1109/spdp.1996.570332

Cited by 65 publications

(37 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The 3-DSPHB algorithm splits and sorts D into two subsets D U where contains every node in N U that has a higher label than that of the source node and D L where contains every node in N L that has a lower label than that of the source node. 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59, 60, 61, 62, 63} D L = {24, 23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4 …”

Section: Comparative Studymentioning

confidence: 99%

“…No communication can occur over the deadlocked channels until exceptional action is taken to break the deadlock [12], [13]. Based on these features, many several routing algorithms have been proposed for wormhole communications networks [14], [15], [16], [17], [18], [19], [20], [21] and [22]. The main facility of the wormhole routing is the communication latency, where it independent of the distance between the source and destination nodes; it consists of three parts, start-up latency network latency, and blocking latency.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Three-Dimension Hamiltonian Broadcast Wormhole-Routing

El-Obaid¹

2015

IJCNC

View full text Add to dashboard Cite

Broadcast is one of the most important approach in distributed memory parallel computers that is used to find a routing approach from a one source to all nodes in the mesh. Broadcasting is a data communication task in which corresponds 1.INTRODUCTIONOne of the important and popular architecture in both of scientific computation and high speed computing applications is multicomputer architecture where it is used efficiently in weather forecast and high performance servers. Multicomputer network consists of hundreds or thousands of nodes connected in some fixed topology; each of them contains a microprocessor, local memory, and other supporting devices. Most of the popular direct network topologies fall in the general category of either n-dimensional meshes or k-ary n-cubes because their regular topologies and simple routing. Some sample topologies are shown in Fig. 1. Among topologies, the most commonly used are meshes, tori, hypercubes and trees. The Mesh-based topologies are the most regular simple architecture that is used in multicomputers. This is because that the implementation of mesh is very simple and easy to understand. These properties which are necessary for every topology design [1]. Recent interest in multicomputer systems is therefore concentrated on two-dimensional or three-dimensional mesh and torus networks. Such technology has been adopted by the Intel Touchstone DELTA

show abstract

Section: Comparative Studymentioning

confidence: 99%

mentioning

confidence: 99%

Three-Dimension Hamiltonian Broadcast Wormhole-Routing

El-Obaid¹

2015

IJCNC

View full text Add to dashboard Cite

show abstract

“…In multiple unicast, routers do not need to add any extra component and just treat multicast traffic as unicast traffic. Tree-based multicast routing [13] is to deliver the message along a common path as far as possible, then replicate the message and forward the copy on a different channel bound for a unique set of destination nodes. The path followed by each copy will further branch in the same manner until the message reaches every destination node.…”

Section: Related Workmentioning

confidence: 99%

Recursive partitioning multicast: A bandwidth-efficient routing for Networks-on-Chip

Wang

Yan

Kim

et al. 2009

2009 3rd ACM/IEEE International Symposium on Networks-on-Chip

View full text Add to dashboard Cite

show abstract

“…1 shows one configuration of this kind of deadlock. To solve this problem, several approaches have been proposed, such as detecting and recovering [2], pruning [3,4]. However, these approaches either needs a large buffer to hold the entire packet or highly complicates router logic, which are not suitable for the Network-on-Chip.…”

Section: Introductionmentioning

confidence: 99%

A hybrid multicast deadlock-free scheme for virtualization at the NoC level

Liu

Zhang

2011

IEICE Electron. Express

View full text Add to dashboard Cite

Abstract:A new hybrid multicast deadlock-free scheme is proposed to enhance the multicast capability. In the proposed scheme, the small-sized multicast packet is routed in a deadlock-free way by packetbuffered and asynchronous replication, and the large-sized multicast packet is transferred under the control of centralized allocator, which restricts the number of concurrent multicast with large-sized packet transmission. The virtualization at the Network-on-Chip (NoC) level is also taken into consideration, that the allocator reserves respective counters for each sub-network. According to result of the experiment under the real workload traces, the performance reduction caused by centralized allocator is negligible. The router and the allocator are synthesized in Chartered 90 nm CMOS technology. Compared with the only packet-buffered scheme, the allocator only consumes extra 0.079% to 0.2972% area overhead according to the different setting (routing mechanism, network size, number of supported sub-network) while offering the ability of large-sized multicast packet transmission.

show abstract

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

Cited by 65 publications

References 6 publications

Three-Dimension Hamiltonian Broadcast Wormhole-Routing

Three-Dimension Hamiltonian Broadcast Wormhole-Routing

Recursive partitioning multicast: A bandwidth-efficient routing for Networks-on-Chip

A hybrid multicast deadlock-free scheme for virtualization at the NoC level

Contact Info

Product

Resources

About