ACM Home Page
Please provide us with feedback. Feedback
Efficient link capacity and QoS design for network-on-chip
Full text PdfPdf (299 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings table of contents
Munich, Germany
SESSION: Allocation and scheduling for MPSoCs and NoCs table of contents
Pages: 9 - 14  
Year of Publication: 2006
ISBN:3-9810801-0-6
Authors
Zvika Guz  Technion, Haifa, Israel
Isask'har Walter  Technion, Haifa, Israel
Evgeny Bolotin  Technion, Haifa, Israel
Israel Cidon  Technion, Haifa, Israel
Ran Ginosar  Technion, Haifa, Israel
Avinoam Kolodny  Technion, Haifa, Israel
Sponsors
: The EDA Consortium
EDAA : European Design and Automation Association
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 85,   Citation Count: 6
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

This paper addresses the allocation of link capacities in the automated design process of a network-on-chip based system. Communication resource costs are minimized under Quality-of-Service timing constraints.First, we introduce a novel analytical delay model for virtual channeled wormhole networks with non-uniform link capacities that eliminates costly simulations at the inner-loop of the optimization process. Second, we present an efficient capacity allocation algorithm that assigns link capacities such that packet delays requirements for each flow are satisfied. We demonstrate the benefit of capacity allocation for a typical system on chip, where the traffic is heterogeneous and delay requirements may largely vary, in comparison with the standard approach which assumes uniform-capacity links.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
 
4
 
5
 
6
 
7
W.J. Dally and C. Seitz. The Torus Routing Chip. Distributed Computing, vol. 1, no. 3, 1986, pp. 187--196
 
8
H. Sarbazi-Azad, A. Khonsari and M. Ould-khaoua. Performance Analysis of Deterministic Routing in Wormhole k-ary n-cubes with Virtual Channels. Journal of Interconnection Networks, 2002, vol. 3
 
9
 
10
 
11
 
12
R. I. Greenberg and L. Guan. Modeling and Comparison of Wormhole Routed Mesh and Torus Networks. IASTED, 1997
 
13
 
14
 
15
16
 
17
L. Kleinrock. Queuing Systems, volume 1: Theory, John Wiley & Sons Inc, New York, 1975
 
18
OPNET modeler (www.opnet.com)

Collaborative Colleagues:
Zvika Guz: colleagues
Isask'har Walter: colleagues
Evgeny Bolotin: colleagues
Israel Cidon: colleagues
Ran Ginosar: colleagues
Avinoam Kolodny: colleagues