Region-Based Routing: A Mechanism to Support Efficient Routing Algorithms in NoCs

Mejia,; Palesi,; Flich,; Kumar, Vivek; Lopez, _; Holsmark,; Duato, J.

doi:10.1109/tvlsi.2008.2012010

Cited by 56 publications

(48 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature, routing tables are typically used to route packets in irregular topologies [25]. However, if the traffic pattern is not predictable, as for the traffic generated by cache coherence protocols [9], building routing tables may incur additional delay.…”

Section: Existing Multicasting Schemes For Irregular 2-d Nocsmentioning

confidence: 99%

Efficient multicast schemes for 3-D Networks-on-Chip

Wang

Yang

Jiang

et al. 2013

Journal of Systems Architecture

Self Cite

View full text Add to dashboard Cite

a b s t r a c t 3-D Networks-on-Chip (NoCs) have been proposed as a potent solution to address both the interconnection and design complexity problems facing future System-on-Chip (SoC) designs. In this paper, two topology-aware multicast routing algorithms, Multicasting XYZ (MXYZ) and Alternative XYZ (AL + XYZ) algorithms in supporting of 3-D NoC are proposed. In essence, MXYZ is a simple dimension order multicast routing algorithm that targets 3-D NoC systems built upon regular topologies. To support multicast routing in irregular regions, AL + XYZ can be applied, where an alternative output channel is sought to forward/replicate the packets whenever the output channel determined by MXYZ is not available. To evaluate the performance of MXYZ and AL + XYZ, extensive experiments have been conducted by comparing MXYZ and AL + XYZ against a path-based multicast routing algorithm and an irregular region oriented multiple unicast routing algorithm, respectively. The experimental results confirm that the proposed MXYZ and AL + XYZ schemes, respectively, have lower latency and power consumption than the other two routing algorithms, meriting the two proposed algorithms to be more suitable for supporting multicasting in 3-D NoC systems. In addition, the hardware implementation cost of AL + XYZ is shown to be quite modest.

show abstract

Section: Existing Multicasting Schemes For Irregular 2-d Nocsmentioning

confidence: 99%

Efficient multicast schemes for 3-D Networks-on-Chip

Wang

Yang

Jiang

et al. 2013

Journal of Systems Architecture

Self Cite

View full text Add to dashboard Cite

show abstract

“…Design issues and possibilities of region are pointed out in [16] and several fault-tolerant routing algorithms adapted for region have been presented. Regionbased Routing (RBR) proposed in [17] groups destinations into network regions allowing an efficient implementation with logic blocks. However, the number of regions required depends on the regularity of the topology (the number of failures and their positions), and each region needs a complete set of routing logic which also limits its scalability.…”

Section: Related Work and Motivationmentioning

confidence: 99%

A Scalable and Reconfigurable Fault-Tolerant Distributed Routing Algorithm for NoCs

Shi

Zeng

2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYManufacturing defects in the deep sub-micron VLSI process and aging resulted problems of devices during lifecycle are inevitable, and fault-tolerant routing algorithms are important to provide the required communication for NoCs in spite of failures. The proposed algorithm, referred to as scalable and reconfigurable fault-tolerant distributed routing (RFDR), partitions the system into nine regions using the concept of divideand-conquer. It is a distributed algorithm, and each router guarantees faulttolerance within one's own region and the system can be still sustained with multiple fault areas. The proposed RFDR has excellent scalability with hardware cost keeping constant independent of system size. Also it is completely reconfigurable when new nodes fail. Simulations under various synthetic traffic patterns show its better performance compared to Extended-XY routing algorithm. Moreover, there is almost no hardware overhead compared to Logic-Based Distributed Routing (LBDR), but the fault-tolerance capacity is enhanced in the proposed algorithm. Hardware cost is reduced 37 % compared to Reconfigurable Distributed Scalable Predictable Interconnect Network (R-DSPIN) which only supports single fault region.

show abstract

“…The main advantage of table-based routing is that it can be used in any topology and with any routing algorithm [9]. However, as the size of NoC increasing, the memory requirements for building such routing tables also increase, thus exhibiting longer access delay and consuming more areas and power overheads [8].…”

Section: Related Workmentioning

confidence: 99%

“…The topology and routing algorithm are the two important features that influence the network performance, cost and power consumption [8]. The Regular topology, especially the 2D mesh topology, becomes a kind of popular architecture for NoC design, for it is very simple and efficient from a layout perspective [9], [10].…”

Section: Introductionmentioning

confidence: 99%

“…In order to fully exploit the increasing number of cores and get enough parallelism for applications, virtualization for multicore chips is becoming necessary [8], [10], [11], [12]. The virtualized NoC solution provides several advantages such as increasing resource utilization, reducing power consumption and increasing the yield of chips [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Convex-Based DOR Routing for Virtualization of NoC

Sun¹,

Zhang²,

Li³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Network on Chip (NoC) is proposed as a promising intra-chip communication infrastructure. A simple and efficient routing scheme is important for large scale NoC to provide the required communication performance to applications with low area and power overheads. Although mesh is preferred for NoC, virtualization may lead to irregular topologies. In this paper, we propose a Convex-Based DOR (CBDOR) routing scheme for the convex topologies. We demonstrate the connectedness and deadlock-freedom of CBDOR. This routing mechanism relies only on two bits per switch. Simulation results show that the area overhead of CBDOR switch is just 2.2% higher than that of traditional DOR switch, with the added complexity negligible. Therefore, the simplicity in the routing mechanism and switch architecture makes CBDOR more practical and scalable when compared to LBDR and FDOR.

show abstract

Region-Based Routing: A Mechanism to Support Efficient Routing Algorithms in NoCs

Cited by 56 publications

References 30 publications

Efficient multicast schemes for 3-D Networks-on-Chip

Efficient multicast schemes for 3-D Networks-on-Chip

A Scalable and Reconfigurable Fault-Tolerant Distributed Routing Algorithm for NoCs

Convex-Based DOR Routing for Virtualization of NoC

Contact Info

Product

Resources

About