Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/24635
Title: Analysis of worst-case backlog bounds for Networks-on-Chip
Authors: Wang, J
Qian, Y
Wang, Y
Shao, Z 
Dou, W
Dou, Q
Keywords: Congestion
Directed-contention-graph
Network calculus
Networks-on-chip
Worst-case backlog bound
Issue Date: 2014
Publisher: Elsevier
Source: Journal of systems architecture, 2014, v. 60, no. 6, p. 494-508 How to cite?
Journal: Journal of Systems Architecture 
Abstract: In networks-on-chips (NoCs), analyzing the worst-case backlog bounds of routers is very important to identify network congestions and improve network performance. In this paper, we propose a method called DiGB (DIrected- contention-Graph-based Backlog bound derivation) to analyze worst-case backlog bounds. For primitive scenarios, we propose analytical models for backlog bound derivation. For complex scenarios, we first construct a directed-contention- graph (DCG) to analyze the relationships among traffic flows. Then, we use the Breadth-First-Search strategy to traverse the DCG so that complex scenarios can be divided into primitive scenarios. Finally we compute the worst-case backlog bounds of each router. To illustrate this method, we present the derivation of closed-form formulas to compute the worst-case backlog bounds under all-to-one gather communication. The experimental results show that our method can achieve correct and tight worst-case backlog bounds.
URI: http://hdl.handle.net/10397/24635
ISSN: 1383-7621
DOI: 10.1016/j.sysarc.2014.03.001
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Feb 20, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Feb 19, 2017

Page view(s)

23
Last Week
2
Last month
Checked on Feb 19, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.