Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes

@inproceedings{Duato1994PerformanceEO,
  title={Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes},
  author={Jos{\'e} Duato and Pedro L{\'o}pez},
  booktitle={PCRCW},
  year={1994}
}
Deadlock avoidance is a key issue in wormhole networks. A first approach [9] consists in removing the cyclic dependencies between channels. Although the absence of cyclic dependencies is a necessary and sufficient condition for deadlock-free deterministic routing, it is only a sufficient condition for deadlock-free adaptive routing. A more powerful approach [12] only requires the absence of cyclic dependencies on a connected channel subset. Moreover, we proposed a necessary and sufficient… 

A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

  • J. Duato
  • Computer Science
    1994 International Conference on Parallel Processing Vol. 1
  • 1994
TLDR
A partially adaptive routing algorithm for k-ary n-cubes which doubles the throughput without increasing the hardware complexity significantly and is the key for the design of maximally adaptive routing algorithms with minimum restrictions.

Increasing the adaptivity of routing algorithms for k-ary n-cubes

TLDR
This paper analyzes the behavior of adaptive routing algorithms both for deadlock avoidance and recovery, exploiting this increased routing flexibility, and compares them with previous proposals in order to evaluate the contribution of the additional routing freedom on network performance.

Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery

TLDR
This paper presents a simple and efficient minimal adaptive wormhole routing algorithm that recovers from potential deadlocks by removing from the network those packets that have stalled for more than a given timeout in a router.

LIFE: a limited injection, fully adaptive, recovery-based routing algorithm

TLDR
This work presents a recovery-based fully adaptive routing algorithm, LIFE, which is based on an innovative injection policy that reduces the probability of deadlocks to negligible values, both with uniform and non-uniform traffic patterns.

Minimal adaptive routing with limited injection on Toroidal k-ary n-cubes

TLDR
A minimal adaptive routing algorithm that tries to balance the use of the virtual channels by limiting the injection of new packets into the network by increasing the saturation point and to keep the network throughput stable at high traffic rates is presented.

A Framework for Designing Deadlock-Free Wormhole Routing Algorithms

TLDR
A framework to design fully-adaptive, deadlock-free wormhole algorithms for a variety of network topologies and an analysis of the resource requirements and performances of a proposed algorithm, called negative-hop algorithm, with some of the previously proposed algorithms for torus and mesh networks is presented.

IODET: A HoL-blocking-aware Deterministic Routing Algorithm for Direct Topologies

TLDR
This paper takes the challenge of developing a HOL-blocking-aware deterministic routing algorithm that can obtain a similar or even better performance than adaptive routing, while decreasing its implementation complexity and providing some inherent advantages to deterministic routed such as in-order delivery of packets.

A Performance Model for Duato's Fully Adaptive Routing Algorithm in k-Ary n-Cubes

TLDR
A new analytical model for obtaining latency measures in high-radix k-ary n-cubes with fully adaptive routing, based on Duato's algorithm (1998), is proposed.

Total-exchange on wormhole k-ary n-cubes with adaptive routing

  • F. Petrini
  • Computer Science
    Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing
  • 1998
TLDR
A simple randomized algorithm to efficiently schedule the total exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching is presented, based on an important property of the wormhole networks that reach high throughput under uniform traffic.

Minimal vs. non Minimal Adaptive Routing on k-ary n-cubes

TLDR
It is argued that non minimal algorithms should pose an upper bound on the degree of adaptivity in order to avoid performance degradations due to excessive misrouting.
...

References

SHOWING 1-10 OF 30 REFERENCES

A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

  • J. Duato
  • Computer Science
    1994 International Conference on Parallel Processing Vol. 1
  • 1994
TLDR
A partially adaptive routing algorithm for k-ary n-cubes which doubles the throughput without increasing the hardware complexity significantly and is the key for the design of maximally adaptive routing algorithms with minimum restrictions.

An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes

TLDR
The concept of virtual channels is extended to multiple virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free, and virtual interconnection networks allowing adaptive, deadlocks-free routing are examined.

Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm

  • J. Duato
  • Computer Science
    Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing
  • 1991
TLDR
A new adaptive routing algorithm is evaluated under different load conditions and compared with other algorithms, showing that the new design methodology supplies faster routing algorithms, at least for those networks with a high connectivity.

A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

  • J. Duato
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1993
The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed. The author proposes some basic definitions and two theorems. These create

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

TLDR
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.

On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies

  • J. Duato
  • Computer Science, Business
    PARLE
  • 1991
Second generation multicomputers use wormhole routing, allowing a very low channel set-up time and drastically reducing the dependency between network latency and internode distance. Deadlock-free

The Message Flow Model for Routing in Wormhole-Routed Networks

TLDR
A new approach to deadlock-free routing in wormhole-routed networks called the message flow model is introduced, which is used to develop new, efficient adaptive routing algorithms for 2D meshes and hypercubes.

Planar-adaptive routing: low-cost adaptive networks for multiprocessors

TLDR
This paper provides the simplest known support for deadlock-free adaptive routing in k-ary n-cubes of more than two dimensions (with k > 2) and restricts adaptivity reduces the hardware complexity, improving router speed or allowing additional performance-enhancing network features.

The Turn Model for Adaptive Routing

  • C. GlassL. Ni
  • Computer Science
    [1992] Proceedings the 19th Annual International Symposium on Computer Architecture
  • 1992
TLDR
Simulations of partially adaptive and nonadaptive routing algorithms for 2D meshes and hypercubes show that which algorithm has the lowest latencies and highest sustainable throughput depends on the pattern of message traffic.

Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks

TLDR
Four worm-hole routing techniques for the two-dimensional torus are experimentally evaluated using a dynamic message injection model and different traffic patterns and message lengths.