Deterministic routing

In telecommunications, deterministic routing is the advance determination of the routes between given pairs of nodes. Examples: 1. * In a network… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
05101519772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Consider a clique of <i>n</i> nodes, where in each synchronous round each pair of nodes can exchange <i>O(log n)</i> bits. We… (More)
Is this relevant?
2010
2010
In this paper, we present a system-level Congestion-Aware Routing (CAR) framework for designing minimal deterministic routing… (More)
  • figure 2
  • figure 3
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Network-on-Chip (NoC) is a new paradigm for designing future SoCs. It supports high degree of reusability, scalability, and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Clusters of PCs have become very popular to build high performance computers. These machines use commodity PCs linked by a high… (More)
Is this relevant?
2004
2004
In this paper, we present a family of novel P2P routing schemes based on Chord [26] (and its variation FChord(α) [2]) that trades… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 7
  • figure 6
Is this relevant?
1996
1996
In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is… (More)
Is this relevant?
1994
1994
We present deterministic algorithms for k-k routing and k-k sorting on circular processor arrays with bidirectional connections… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
− This paper develops detailed analytical performance models for k-ary n-cube networks with single-flit or infinite buffers… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • José Duato
  • 1994 International Conference on Parallel…
  • 1994
Deadlock avoidance is a key issue in wormhole networks. A first approach [8] consists of removing the cyclic dependencies between… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?