• Corpus ID: 18623743

Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers

@inproceedings{Lin1992DeadlockfreeMW,
  title={Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers},
  author={X. Lin and Philip K. McKinley and Lionel M. NiDepartment},
  year={1992}
}
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE-2, a wormhole-routed hyper-cube multicomputer, provides hardware support for broadcast and a restricted form of multicast in which the destinations form a subcube. However, the broadcast routing… 

Multicast Communication on Wormhole-Routed Star Graph Interconnection Networks with Tree-Based Approach

In this paper, an efficient and deadlock-free tree-based multicast routing scheme for wormhole-routed star graph networks with hamiltonian path is addressed and results demonstrate that the proposed routing scheme outperform the previous approaches.

Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model

Hamiltonian-cycle-based multicasting on wormhole-routed torus networks

An efficient multipath multicast routing algorithm with Hamiltonian cycle model (mulitpath-HCM) is presented, which utilizes communication channels more uniformly in order to reduce the path length of the routing messages, making the multicasting more efficient.

Dual-tree-based multicasting on wormhole-routed irregular switch-based networks

Multi-node multicast in three and higher dimensional wormhole tori and meshes with load balance

This paper considers the multi-node multicast problem in a multi-dimensional wormhole-routed torus/mesh, and shows how to use a network-partitioning approach to achieve this goal.

Multi-Node Multicast in Multi-Dimensional Wormhole Tori and Meshes With Load Balance

This paper considers the multi-node multicast problem in a multi-dimensional wormhole-routed torus/mesh, where there is an arbitrary number of source nodes, each intending to multicast a message to

Dual-Hamiltonian-path-based multicasting on wormhole-routed star graph interconnection networks

Experimental results are given to show the proposed three routing schemes outperform the unicast-based, the Hamiltonian-path, and the single-Hamiltonian- path-based (SHPB) dual-path routing schemes significantly.

Design and Analysis of Multicast Communication in Multidimensional Mesh Networks

This paper proposes a multicast algorithm for multidimensional interconnection networks, which is built upon the Qualified Groups QG multicast scheme for ensuring efficient communication irrespective of the network sizes/dimensions or the number of the destination nodes.

Fault-tolerant tree-based multicasting in mesh multicomputers

  • Jie WuChen Xiao
  • Computer Science
    Journal of Computer Science and Technology
  • 2008
This approach is the first attempt to address the fault-tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.

A Dilated-Diagonal-Based Scheme for Broadcast in a Wormhole-Routed 2D Torus

  • Y. Tseng
  • Computer Science
    IEEE Trans. Computers
  • 1997
A novel scheme to solve the one-to-all broadcast in a wormhole-routed 2D torus network which provides the dimension-ordered routing and all-port communication capability with the distance-insensitive characteristic of wormhole routing is proposed.

References

SHOWING 1-10 OF 34 REFERENCES

Unicast-Based Multicast Communication in Wormhole-Routed Networks

Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages, and can deliver a multicast message to m-1 destinations in [log/sub 2/ m] message passing steps, while avoiding contention among the constituent Unicast messages.

Multicast Communication in Multiprocessor Systems

Simulations using synthetic and application-driven loads show the proposed cut-through multicast routing scheme has significantly better performance than either multicast emulation or deadlock detection and resolution.

Optimum Broadcasting and Personalized Communication in Hypercubes

Three communication graphs for the Boolean n-cube are proposed for the routing, and scheduling disciplines provably optimum within a small constant factor are proposed, offering optimal communication times for cases (2)-(4) and concurrent communication on all ports of every processor.

ComPaSS: efficient communication services for scalable architectures

The authors describe the initial implementation of the ComPaSS communication library to support scalable software development in massively parallel processors, and the design of the multicast primitive is described, and an example of its use in a data parallel application is given.

Virtual Cut-Through: A New Computer Communication Switching Technique

Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem

The architecture and programming of the Ametek series 2010 multicomputer

A streamlined and easily layered set of message primitives, a node operating system based on a reactive programming model, open interfaces for accelerators and peripheral devices, and node performance improvements that could be achieved economically by using the same technology employed in contemporary workstation computers are proposed.

Multicomputers: message-passing concurrent computers

A status report is provided on the architecture and programming of a family of concurrent computers that are organized as ensembles of small programmable computers called nodes, connected by a

iWarp: an integrated solution to high-speed parallel computing

Because of their strong computation and communication capabilities, the iWarp components provide a versatile building block for high-performance parallel systems ranging from special-purpose systolic arrays to general-purpose distributed memory computers.