• Publications
  • Influence
Interconnection networks - an engineering approach
TLDR
The book's engineering approach considers the issues that designers need to deal with and presents a broad set of practical solutions that address the challenges and details the basic underlying concepts of interconnection networks.
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
  • J. Duato
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1 December 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
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
  • J. Duato
  • Computer Science
    International Conference on Parallel Processing…
  • 15 August 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 effectiveness of directory caches by deactivating coherence for private memory blocks
TLDR
This work proposes to deactivate the coherence protocol for directory caches and to treat them as uniprocessor systems do, which allows directory caches to omit the tracking of an appreciable quantity of blocks, which reduces their load and increases their effective size.
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
  • J. Duato
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1 October 1995
TLDR
This paper proposes a necessary and sufficient condition for deadlock-free adaptive routing, the key for the design of fully adaptive routing algorithms with minimum restrictions, and shows the application of the new theory.
Deterministic versus Adaptive Routing in Fat-Trees
TLDR
The results show that deterministic routing can achieve a similar, and in some scenarios higher, level of performance than adaptive routing, while providing in-order packet delivery.
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori
TLDR
A new deterministic routing methodology for tori and meshes, which achieves high performance without the use of virtual channels, and is topology agnostic in nature, meaning it can handle any topology derived from any combination of faults when combined with static reconfiguration.
Logic-Based Distributed Routing for NoCs
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are
A routing methodology for achieving fault tolerance in direct networks
TLDR
This paper presents a new fault-tolerant routing methodology that does not degrade performance in the absence of faults and tolerates a reasonably large number of faults without disabling any healthy node.
LASH-TOR: a generic transition-oriented routing algorithm
TLDR
This paper proposes an extension of LASH in order to reduce the number of required virtual layers by allowing transitions between virtual layers, and shows that the new routing scheme (LASH-TOR) is able to obtain full minimal routing with a reduced number of virtual channels.
...
1
2
3
4
5
...