ACM Home Page
Please provide us with feedback. Feedback
A unified approach to constrained mapping and routing on network-on-chip architectures
Full text PdfPdf (174 KB)
Source International Conference on Hardware Software Codesign archive
Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis table of contents
Jersey City, NJ, USA
SESSION: Network-on-chip architectures table of contents
Pages: 75 - 80  
Year of Publication: 2005
ISBN:1-59593-161-9
Authors
Andreas Hansson  Lund University, Lund, Sweden
Kees Goossens  Philips Research Laboratories, Eindhoven, The Netherlands
Andrei Rǎdulescu  Philips Research Laboratories, Eindhoven, The Netherlands
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
SIGBED: ACM Special Interest Group on Embedded Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 112,   Citation Count: 27
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1084834.1084857
What is a DOI?

ABSTRACT

One of the key steps in Network-on-Chip (NoC) based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problem first map cores onto a topology and then route communication, using separated and possibly conflicting objective functions. In this paper we present a unified single-objective algorithm, called Unified MApping, Routing and Slot allocation (UMARS). As the main contribution we show how to couple path selection, mapping of cores and TDMA time-slot allocation such that the network required to meet the constraints of the application is minimized. The time-complexity of UMARS is low and experimental results indicate a run-time only 20% higher than that of path selection alone. We apply the algorithm to an MPEG decoder System-on-Chip (SoC), reducing area by 33%, power by 35% and worst-case latency by a factor four over a traditional multi-step approach.


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
J. Dielissen et al. Power measurements and analysis of a network-on-chip. Technical Report NL-TN-2005-0282, Philips Research Laboratories, Eindhoven, 2005.
 
5
O. P. Gangwal et al. Dynamic and Robust Streaming In And Between Connected Consumer-Electronics Devices, Building Predictable Systems on Chip: An Analysis of Guaranteed Communication in the AEthereal Network on Chip. Kluwer, 2005.
 
6
 
7
 
8
R. Guérin and A. Orda. Networks with advance reservations: The routing perspective. In Proc. INFOCOM, 2000.
 
9
R. Guérin et al. QoS routing mechanisms and OSPF extensions. In GLOBECOM, volume 3, 1997.
 
10
11
 
12
 
13
K. Keutzer et al. System-level design: Orthogonalization of concerns and platform-based design. Trans. on CAD of Integrated Circuits and Systems, 19(12), 2000.
 
14
K. Kowalik and M. Collier. Should QoS0 routing algorithms prefer shortest paths? In Proc. ICC, 2003.
 
15
 
16
I. Matta and A. Bestavros. A load profiling approach to routing guaranteed bandwidth flows. In Proc. INFOCOM, 1998.
 
17
18
19
 
20
21
 
22
R. Widyono. The design and evaluation of routing algorithms for real-time channels. TR-94-024, Univ. of Calif. at Berkeley & Int'l Comp. Sci. Inst., 1994.

CITED BY  27

Collaborative Colleagues:
Andreas Hansson: colleagues
Kees Goossens: colleagues
Andrei Rǎdulescu: colleagues