A Unified Approach to Mapping and Routing on a Network-on-Chip for Both Best-Effort and Guaranteed Service Traffic

被引:10
|
作者
Hansson, Andreas [1 ]
Goossens, Kees [2 ,3 ]
Radulescu, Andrei [3 ]
机构
[1] Eindhoven Univ Technol, Dept Elect Engn, NL-5600 MB Eindhoven, Netherlands
[2] Delft Univ Technol, Fac Elect Engn Math & Comp Sci, Comp Engn, NL-2600 GA Delft, Netherlands
[3] NXP Semicond, Res, SOC Architectures & Infrastruct, NL-5656 AE Eindhoven, Netherlands
关键词
D O I
10.1155/2007/68432
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One of the key steps in Network-on-Chip-based design is spatial mapping of cores and routing of the communication between those cores. Known solutions to the mapping and routing problems first map cores onto a topology and then route communication, using separate 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 channel time-slot allocation to minimize the network required to meet the constraints of the application. 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, reducing area by 33%, power dissipation by 35%, and worst-case latency by a factor four over a traditional waterfall approach. Copyright (C) 2007 Andreas Hansson et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
引用
收藏
页数:16
相关论文
共 50 条
  • [1] DESIGN CONCEPT AND MICROARCHITECTURE OF NETWORK-ON-CHIP WITH BEST-EFFORT AND GUARANTEED-THROUGHPUT SERVICES
    Samman, Faizal Arya
    Hollstein, Thomas
    [J]. INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2019, 15 (01): : 305 - 319
  • [2] Optimal link scheduling on improving best-effort and guaranteed services performance in network-on-chip systems
    Leung, Lap-Fai
    Tsui, Chi-Ying
    [J]. 43RD DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2006, 2006, : 833 - 838
  • [3] A unified approach to constrained mapping and routing on network-on-chip architectures
    Hansson, A
    Goossens, K
    Radulescu, A
    [J]. 2005 INTERNATIONAL CONFERENCE ON HARDWARE/SOFTWARE CODESIGN AND SYSTEM SYNTHESIS, 2005, : 75 - 80
  • [4] Dynamic Guaranteed Service Communication on Best-Effort Networks-on-Chip
    Munk, Peter
    Freier, Matthias
    Richling, Jan
    Chen, Jian-Jia
    [J]. 23RD EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2015), 2015, : 353 - 360
  • [5] Routing metrics for best-effort traffic
    Gokhale, SS
    Tripathi, SK
    [J]. ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2002, : 595 - 598
  • [6] Performance Analysis of Guaranteed Throughput and Best Effort Traffic in Network-on-Chip under Different Traffic Scenario
    Paliwal, Krishan Kumar
    Gaur, M. S.
    Laxmi, Vijai
    Janyani, Vijay
    [J]. INTERNATIONAL CONFERENCE ON FUTURE NETWORKS, PROCEEDINGS, 2009, : 74 - +
  • [7] Refining synchronous communication onto network-on-chip best-effort services
    Lu, Zhonghai
    Sander, Ingo
    Jantsch, Axel
    [J]. APPLICATIONS OF SPECIFICATION AND DESIGN LANGUAGES FOR SOCS, 2006, : 23 - 38
  • [8] Trade offs in the design of a router with both guaranteed and best-effort services for networks on chip
    Rijpkema, E
    Goossens, KGW
    Radulescu, A
    Dielissen, J
    van Meerbergen, J
    Wielage, P
    Waterlander, E
    [J]. DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, PROCEEDINGS, 2003, : 350 - 355
  • [9] Trade-offs in the design of a router with both guaranteed and best-effort services for networks on chip
    Rijpkema, E
    Goossens, K
    Radulescu, A
    Dielissen, J
    van Meerbergen, J
    Wielage, P
    Waterlander, E
    [J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (05): : 294 - 302
  • [10] Supporting best-effort traffic with fair service curve
    Ng, TSE
    Stephens, DC
    Stoica, I
    Zhang, H
    [J]. GLOBECOM'99: SEAMLESS INTERCONNECTION FOR UNIVERSAL SERVICES, VOL 1-5, 1999, : 1799 - 1807