Optimal Routing Algorithms for Generalized de Bruijn Digraphs

Liu, Shuai; Lee, Kyungsook Y.

doi:10.1109/icpp.1993.130

Cited by 16 publications

(23 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The de Bruijn topology is another well-known digraph proposed [15] as an efficient topology for multiprocessors. Samathan and Pradhan [16] showed that de Bruijn networks are also favored for VLSI implementation, and several other researchers have studied topological properties, routing algorithms, efficient VLSI layout and other important aspects of de Bruijn networks [11,[16][17][18].…”

Section: The Shuffle-exchange Networkmentioning

confidence: 99%

The 2D digraph-based NoCs: attractive alternatives to the 2D mesh NoCs

2010

View full text Add to dashboard Cite

This paper proposes two-dimensional directed graphs (or digraphs for short) as a promising alternative to the popular 2D mesh topology for networks-onchip (NoCs). Mesh is the most popular topology for the NoCs, mainly due to its suitability for on-chip implementation and low cost. However, the fact that a digraph offers a lower diameter than its equivalent linear array of equal cost motivated us to evaluate digraphs as the underlying topology of NoCs. This paper introduces a family of NoC topologies based on three well-known digraphs, namely de Bruijn, shuffleexchange, and Kautz. We study topological properties of the proposed topologies. We show that the proposed digraph-based topologies have several attractive features including constant node degree, low diameter and cost, and low zero load latency which result in superior performance over the mesh. We introduce a deadlock-free routing algorithm for the proposed NoC topologies and compare NoCs employing the proposed topologies and the mesh topology in terms of power consumption and 2 R. Sabbaghi-Nadooshan et al.performance. Simulation results also reveal that the proposed NoC topologies offer higher performance and consume lower power than the mesh NoC.

show abstract

Section: The Shuffle-exchange Networkmentioning

confidence: 99%

The 2D digraph-based NoCs: attractive alternatives to the 2D mesh NoCs

2010

View full text Add to dashboard Cite

show abstract

“…Since the proposed network topology is based on de Bruijn, this section briefly introduces the de Bruijn topology [10,11]. An n-dimensional de Bruijn topology is a directed graph including …”

Section: The Proposed Network Topology: Dimbmentioning

confidence: 99%

“…At first we find average distance for one dimensional de Bruijn and then extend it for two dimensional de Bruijn. Average distance in de Bruijn is estimated in [10] with below relation…”

Section: The Proposed Performance Modelmentioning

confidence: 99%

Analytical performance modeling of de Bruijn inspired mesh-based network-on-chips

Sabbaghi‐Nadooshan

Patooghy

2015

Microprocessors and Microsystems

View full text Add to dashboard Cite

“…Inspired by the LBDR approach, this work proposes to exploit the optimal shortest-path RA described in [30] for de-Bruijn and Kautz topologies to implement a distributed RA that features lower complexity than the routing-table-based architecture. The proposed solution is applied to the flexible architecture for iterative channel code decoding proposed in [18] extending the results presented in [34].…”

Section: Introductionmentioning

confidence: 99%

“…[28] shows an algorithm to build optimal VLSI layout for de-Bruijn topologies.Another important characteristic of de-Bruijn and Kautz topologies is the self-routing property [29], that is exploited in [30] to develop a shortest-path RA to connect any pair Contents lists available at ScienceDirect journal homepage: www.elsevier.com/locate/vlsi of nodes. Even if [30] solved the problem of building an optimal shortest-path RA for these topologies, low complexity hardware implementations are still of interest in the context of NoC [23][24][25][26][27]. A well known flexible solution to support most topologies and RAs employs routing-tables.…”

Section: Introductionmentioning

confidence: 99%

Exploiting generalized de-Bruijn/Kautz topologies for flexible iterative channel code decoder architectures

et al. 2015

View full text Add to dashboard Cite

a b s t r a c tModern iterative channel code decoder architectures have tight constrains on the throughput but require flexibility to support different modes and standards. Unfortunately, flexibility often comes at the expense of increasing the number of clock cycles required to complete the decoding of a data-frame, thus reducing the sustained throughput. The Network-on-Chip (NoC) paradigm is an interesting option to achieve flexibility, but several design choices, including the topology and the routing algorithm, can affect the decoder throughput. In this work logarithmic diameter topologies, in particular generalized de-Bruijn and Kautz topologies, are addressed as possible solutions to achieve both flexible and high throughput architectures for iterative channel code decoding. In particular, this work shows that the optimal shortest-path routing algorithm for these topologies, that is still available in the open literature, can be efficiently implemented resorting to a very simple circuit. Experimental results show that the proposed architecture features a reduction of about 14% and 10% for area and power consumption respectively, with respect to a previous shortest-path routing-table-based design.

show abstract

Optimal Routing Algorithms for Generalized de Bruijn Digraphs

Cited by 16 publications

References 6 publications

The 2D digraph-based NoCs: attractive alternatives to the 2D mesh NoCs

The 2D digraph-based NoCs: attractive alternatives to the 2D mesh NoCs

Analytical performance modeling of de Bruijn inspired mesh-based network-on-chips

Exploiting generalized de-Bruijn/Kautz topologies for flexible iterative channel code decoder architectures

Contact Info

Product

Resources

About