Proceedings ArticleDOI
Improving the efficiency of adaptive routing in networks with irregular topology
Federico Silla,José Duato +1 more
- pp 330-335
Reads0
Chats0
TLDR
A general methodology for the design of adaptive routing algorithms for networks with irregular topology is proposed that improves a previously proposed one by reducing the probability of routing over non-minimal paths.Abstract:
Networks of workstations are emerging as a cost-effective alternative to parallel computers. The interconnection between workstations usually relies on switch-based networks with irregular topologies. This irregularity makes routing and deadlock avoidance quite complicated. Current proposals avoid deadlock by removing cyclic dependencies between channels and therefore, many messages are routed along non-minimal paths, increasing latency and wasting resources. We propose a general methodology for the design of adaptive routing algorithms for networks with irregular topology that improves a previously proposed one by reducing the probability of routing over non-minimal paths. The resulting routing algorithms allow messages to follow minimal paths in most cases, reducing message latency and increasing network throughput. As an example of application, we propose an improved adaptive routing algorithm for Autonet.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 Survey and Evaluation of Topology-Agnostic Deterministic Routing Algorithms
Jose Flich,Tor Skeie,A. Mejia,Olav Lysne,Pedro López,Antonio Robles,José Duato,Michihiro Koibuchi,Tomas Rokicki,Jose Carlos Sancho +9 more
TL;DR: This paper presents a comprehensive overview of the known topology-agnostic routing algorithms, classify these algorithms by their most important properties, and evaluate them consistently, providing significant insight into the algorithms and their appropriateness for different on- and off-chip environments.
Proceedings ArticleDOI
Layered shortest path (LASH) routing in irregular system area networks
Tor Skeie,Olav Lysne,I. Theiss +2 more
TL;DR: This paper proposes a method that guarantees shortest path routing and in-order delivery, and that uses virtual channels for deadlock avoidance, and presents a theoretical upper bound on the number of virtual channels needed, and demonstrates that the actual number ofvirtual channels is very low even for large networks.
Journal ArticleDOI
A protocol for deadlock-free dynamic reconfiguration in high-speed local area networks
TL;DR: A new deadlock-free distributed reconfiguration protocol that is able to asynchronously update routing tables without stopping user traffic is proposed that is valid for any topology, including regular as well as irregular topologies.
Proceedings ArticleDOI
Fast dynamic reconfiguration in irregular networks
Olav Lysne,José Duato +1 more
TL;DR: This work proposes a method for dynamic reconfiguration of networks using up*/down* routing that aims at reducing the consequences of reconfigurations, and identifies a restricted parr of the network, the skyline, as the only part where a full reconfigured network is necessary.
References
More filters
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
Myrinet: a gigabit-per-second local area network
N.J. Boden,Danny Cohen,R.E. Felderman,A.E. Kulawik,Charles L. Seitz,Jakov Seizovic,Wen-King Su +6 more
TL;DR: The Myrinet local area network employs the same technology used for packet communication and switching within massively parallel processors, but with the highest performance per unit cost of any current LAN.
Journal ArticleDOI
A new theory of deadlock-free adaptive routing in wormhole networks
TL;DR: The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed and some basic definitions and two theorems are proposed, which create the conditions to verify that an adaptive algorithm is deadlocks-free, even when there are cycles in the channel dependency graph.
Journal ArticleDOI
Autonet: a high-speed, self-configuring local area network using point-to-point links
Michael D. Schroeder,Andrew D. Birrell,Michael Burrows,Hallam G. Jr. Murray,Roger M. Needham,Thomas L. Rodeheffer,Edwin H. Jr. Satterthwaite,Charles P. Thacker +7 more
TL;DR: Autonet as mentioned in this paper is a self-configuring local area network composed of switches interconnected by 100 Mb/s, full-duplex, point-to-point links, which uses cut-through to achieve a packet forwarding latency as low as 2 ms/switch.