Wormhole routing in de Bruijn networks and hyper-de Bruijn networks

Ganesan, Elaiyasuriyan; Pradhan, Dhiraj K.

doi:10.1109/iscas.2003.1205158

Cited by 16 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ganesan and Pradhan [7] has proposed a routing algorithm which routes packets toward destinations by changing one bit at a time, starting from the most left bit of an n-bit address in a network of size 2 n . At the ith step of the algorithm, the (n À ith) bit of the destination address is compared to the most left bit of the current address.…”

Section: Proposed Routing Algorithm For Dimbmentioning

confidence: 99%

“…The de Bruijn topology is a well-known structure which is initially proposed [5] for parallel processing networks. Several researchers have studied topological properties [6], routing algorithms [7,8], VLSI layout efficiency [6] and other aspects of the de Bruijn networks [9]. NoC designers also favor to the de Bruijn topology, since it provides logarithmic diameter and costs equal to a linear array topology [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Proposed Routing Algorithm For Dimbmentioning

confidence: 99%

Section: Introductionmentioning

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

“…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%

“…Ganesan [18] proposed a similar routing algorithm for de Bruijn networks. The only difference between his scheme and Dally's algorithm is that: if the two compared bits (in Dally's algorithm) are equal, the message is routed over the shuffle link, to keep the bit unchanged and rotate the address pattern.…”

Section: Routing In Digraphsmentioning

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

“…The vast majority of structured overlays base their topologies and routing techniques on exact, peer keydependent core structures like rings [28,37], trees [1,29], de Bruijn graphs [11], hypercubes [35], butterfly networks [27], etc. As discussed in the motivation part -all of them to a very high extent lack the flexibility of choosing the neighbors on the close neighborhood level, which makes the maintenance more complicated.…”

Section: Related Systemsmentioning

confidence: 99%

Fuzzynet: Ringless routing in a ring-like structured overlay

Girdzijauskas

Galuba

Darlagiannis

et al. 2010

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guarantees, each node needs to eagerly maintain its immediate neighboring links -the ring invariant. However, the ring maintenance is an expensive task and it may not even be possible to maintain the ring invariant continuously under high churn, particularly as the network size grows. Furthermore, routing anomalies in the network, peers behind firewalls and Network Address Translators (NATs) create non-transitivity effects, which inevitably lead to the violation of the ring invariant. We argue that reliance on the ring structure is a serious impediment for real life deployment and scalability of structured overlays. In this paper we propose an overlayThe work presented in this paper was (partly) carried out in the framework of the EPFL Center

show abstract

Wormhole routing in de Bruijn networks and hyper-de Bruijn networks

Cited by 16 publications

References 14 publications

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

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

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

Fuzzynet: Ringless routing in a ring-like structured overlay

Contact Info

Product

Resources

About