Journal ArticleDOI
Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: algorithms and simulations
Reads0
Chats0
TLDR
Several new routing algorithms for different interconnection networks are presented, including fully-adaptive and minimal, and can be used alternatively for virtual cut-through routing models.Abstract:
This paper deals with the problem of packet-switched routing in parallel machines. Several new routing algorithms for different interconnection networks are presented. While the new techniques apply to a wide variety of networks, routing algorithms will be shown for the hypercube, the two-dimensional mesh, and the shuffle-exchange. Although the new techniques are designed for packet routing, they can be used alternatively for virtual cut-through routing models. The techniques presented for hypercubes and meshes are fully-adaptive and minimal. A fully-adaptive and minimal routing is one in which all possible minimal paths between a source and a destination are of potential use at the time a message is injected into the network. Minimal paths followed by messages ultimately depend on the local congestion encountered in each node of the network. All of the new techniques are completely free of deadlock situations. >read more
Citations
More filters
Book
Interconnection Networks
TL;DR: The authors present in a structured way the basic underlying concepts of most interconnection networks and provide representative solutions that have been implemented in the industry or proposed in the research literature.
Journal ArticleDOI
A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks
TL;DR: The theoretical background for the design of deadlock-free adaptive routing algorithms for virtual cut-through and store-and-forward switching is developed and a design methodology is proposed, which automatically supplies fully adaptive, minimal and non-minimal routing algorithms.
Proceedings ArticleDOI
ROMM routing on mesh and torus networks
Ted Nesson,S. Lennart Johnsson +1 more
TL;DR: Analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks show that ROMM algorithms can perform several representative routing tasks 1.5 to 3 times faster than fully randomized algorithms, for medium--sized networks.
Journal ArticleDOI
Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed paths
TL;DR: The multidestination mechanism and the BRCP model establish a new foundation to provide fast and scalable collective communication support on wormhole-routed systems.
Journal ArticleDOI
A general theory for deadlock-free adaptive routing using a mixed set of resources
José Duato,Timothy Mark Pinkston +1 more
TL;DR: The proposed theory and methodology allow the design of efficient network routers that require minimal resources for handling infrequent deadlocks and allow channel queues to be allocated nonatomically, utilizing resources efficiently.
References
More filters
Book
The Connection Machine
TL;DR: The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
Journal ArticleDOI
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
TL;DR: In this article, a deadlock-free routing algorithm for arbitrary interconnection networks using the concept of virtual channels is presented, where the necessary and sufficient condition for deadlock free routing is the absence of cycles in a channel dependency graph.
Book
Deadlock-free message routing in multiprocessor interconnection networks
TL;DR: A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels, which is used to develop deadlocked routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.
Journal ArticleDOI
Virtual cut-through: A new computer communication switching technique
Parviz Kermani,Leonard Kleinrock +1 more
TL;DR: The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
Book
Virtual-channel flow control
TL;DR: Simulation studies show that, given a fixed amount of buffer storage per link, virtual-channel flow control increases throughput by a factor of 3.5, approaching the capacity of the network.