• Publications
  • Influence
Interconnection networks - an engineering approach
TLDR
From the Publisher: Addresses the challenges and details the basic underlying concepts of interconnection networks and presents a broad set of practical solutions. Expand
  • 2,175
  • 266
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
  • J. Duato
  • Computer Science
  • IEEE Trans. Parallel Distributed Syst.
  • 1 December 1993
TLDR
The theoretical background for the design of deadlock-free adaptive routing algorithms for wormhole networks is developed. Expand
  • 831
  • 70
  • PDF
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
We propose a necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. Expand
  • 236
  • 26
Increasing the effectiveness of directory caches by deactivating coherence for private memory blocks
TLDR
We propose to deactivate the coherence protocol for directory caches and treat them as uniprocessor systems do. Expand
  • 139
  • 22
  • PDF
Logic-Based Distributed Routing for NoCs
TLDR
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Expand
  • 85
  • 15
  • PDF
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
In this paper, we show that the previously mentioned approach is also a sufficient condition for deadlock-free adaptive routing. Expand
  • 158
  • 14
Deterministic versus Adaptive Routing in Fat-Trees
TLDR
In this paper, we propose a deterministic routing algorithm for fat-trees, comparing it with adaptive routing in several workloads. Expand
  • 146
  • 14
  • PDF
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and tori
TLDR
This paper proposes a new deterministic routing methodology for tori and meshes, which achieves high performance without the use of virtual channels. Expand
  • 139
  • 14
  • PDF
A routing methodology for achieving fault tolerance in direct networks
TLDR
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. Expand
  • 92
  • 12
  • PDF
LASH-TOR: a generic transition-oriented routing algorithm
TLDR
We propose an extension of LASH in order to reduce the number of required virtual layers by allowing transitions between virtual layers. Expand
  • 54
  • 10
  • PDF