Trade-offs in the design of a router with both guaranteed and best-effort services for networks on chip

2003 ◽  
Vol 150 (5) ◽  
pp. 294 ◽  
Author(s):  
E. Rijpkema ◽  
K. Goossens ◽  
A. Rdulescu ◽  
J. Dielissen ◽  
J. van Meerbergen ◽  
...  
Keyword(s):  
Best Effort ◽  
Networks On Chip ◽  
Trade Offs ◽  
On Chip

Trade offs in the design of a router with both guaranteed and best-effort services for networks on chip

2003 ◽  
Author(s):  
E. Rijpkema ◽  
K.G.W. Goossens ◽  
A. Radulescu ◽  
J. Dielissen ◽  
J. van Meerbergen ◽  
...  
Keyword(s):  
Best Effort ◽  
Networks On Chip ◽  
Trade Offs ◽  
On Chip

Trade-offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks on Chip

2008 ◽  
pp. 125-139 ◽  
Author(s):  
E. Rijpkema ◽  
K. G. W. Goossens ◽  
A. Rădulescu ◽  
J. Dielissen ◽  
J. van Meerbergen ◽  
...  
Keyword(s):  
Best Effort ◽  
Networks On Chip ◽  
Trade Offs ◽  
On Chip

Designing best effort networks-on-chip to meet hard latency constraints

2013 ◽  
Vol 12 (4) ◽  
pp. 1-23 ◽  
Author(s):  
Ciprian Seiculescu ◽  
Dara Rahmati ◽  
Srinivasan Murali ◽  
Hamid Sarbazi-Azad ◽  
Luca Benini ◽  
...  
Keyword(s):  
Best Effort ◽  
Networks On Chip ◽  
On Chip

scholarly journals Computing Accurate Performance Bounds for Best Effort Networks-on-Chip

2013 ◽  
Vol 62 (3) ◽  
pp. 452-467 ◽  
Author(s):  
Dara Rahmati ◽  
Srinivasan Murali ◽  
Luca Benini ◽  
Federico Angiolini ◽  
Giovanni De Micheli ◽  
...  
Keyword(s):  
Performance Bounds ◽  
Best Effort ◽  
Networks On Chip ◽  
Accurate Performance ◽  
On Chip

FXY: A HIERARCHICAL ROUTING ALGORITHM TO BALANCE PERFORMANCE AND FAULT TOLERANCE IN NETWORKS-ON-CHIP

2014 ◽  
Vol 23 (10) ◽  
pp. 1450146 ◽  
Author(s):  
SALEH FAKHRALI ◽  
HAMID R. ZARANDI
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Experimental Results ◽  
Balance Performance ◽  
Networks On Chip ◽  
Large Size ◽  
Trade Offs ◽  
And Performance ◽  
On Chip

This paper presents a hierarchical fault-tolerant routing algorithm called FXY, which is a hybrid method based on flooding and XY, and can balance performance and fault tolerance based on a predefined parameter m. First, FXY partitions the whole network into different equal size square submeshes with the size of m × m. At the first level of the hierarchy, packet routing within these submeshes is performed based on flooding routing algorithm. When the packets are received at effective boundary of each submesh, XY routing is performed to route the packet inter submeshes i.e., from one submesh to the neighbor submesh which is certainly one of its neighbor nodes. Here, the size of the submesh is defined as fault-tolerant granularity. As fault-tolerant granularity is increased, the size of the submeshes will be increased, therefore the method mainly floods packets in large-size submeshes and finally packets are received at their destinations correctly. On the other hand, when fault-tolerant granularity is decreased, the method mainly routes packets as XY method, which is not fault-tolerant, but has the best performance. The method is evaluated for various packet injection rates and fault rates. The experimental results reveal that the method presents a fault-tolerant routing algorithm, and can be adjusted so that it shows better fault-tolerance and performance trade-offs compared to XY and flooding which are two end-to-end cases of having the best performance and no fault-tolerance, having the least performance and the best fault tolerance, respectively. The experimental results for an 8 × 8 NoC size, have shown that 2-FXY, which is the proposed method with fault-tolerant granularity of two, offers the best trade-off between performance and fault tolerance compared to other methods, XY, flooding and probabilistic flooding.

Sign in / Sign up

Export Citation Format

Share Document