9th EUROMICRO Conference on Digital System Design (DSD'06) 2006
DOI: 10.1109/dsd.2006.81
|View full text |Cite
|
Sign up to set email alerts
|

Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication

Abstract: Abstract. Network-on-chip-based multiprocessor systems-onchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-onchip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(15 citation statements)
references
References 29 publications
0
15
0
Order By: Relevance
“…While the authors announce the resource utilization improvement of BAA, the algorithm complexity is not discussed which might have the expensive hardware implementation. A good compromise in the allocation of routes and TDMA slots for on-chip streaming communication is found by heuristic strategies in [12]. Leung et.…”
Section: Related Workmentioning
confidence: 99%
“…While the authors announce the resource utilization improvement of BAA, the algorithm complexity is not discussed which might have the expensive hardware implementation. A good compromise in the allocation of routes and TDMA slots for on-chip streaming communication is found by heuristic strategies in [12]. Leung et.…”
Section: Related Workmentioning
confidence: 99%
“…Each user-case entails a specific traffic pattern on NoC. This application specific nature, as opposed to the largely random traffic in chip multiprocessors, allows guaranteed service to be obtained by reserving resources at design-time [1][2][3][4][5][6]. The resources include both physical ones -links along a packet routing path, and temporal ones -time slots at each link, i.e., the resource allocation is based on Time Division Multiplexing (TDM).…”
Section: Introductionmentioning
confidence: 99%
“…For example, several works have presented approaches to dynamically manage and reduce the network's power consumption [Jafri et al 2012;Mishra et al 2010;Kim et al 2011]. Others have proposed alternative scheduling [Stuijk et al 2006], resource reservation methods , and arbitration schemes that achieve better QoS or provide QoS bounds for certain types of traffic [Al Faruque et al 2006]. Several works have also described changes in network topology [Das et al 2009] and features in order to better meet the demands of applications running on the CMP [Krishna et al 2011].…”
Section: Related Workmentioning
confidence: 99%