Please use this identifier to cite or link to this item:
https://doi.org/10.1109/DSD.2012.85
DC Field | Value | |
---|---|---|
dc.title | Minimizing power consumption of spatial division based networks-on-chip using multi-path and frequency reduction | |
dc.contributor.author | Wang, S.H. | |
dc.contributor.author | Das, A. | |
dc.contributor.author | Kumar, A. | |
dc.contributor.author | Corporaal, H. | |
dc.date.accessioned | 2014-06-19T03:18:09Z | |
dc.date.available | 2014-06-19T03:18:09Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Wang, S.H.,Das, A.,Kumar, A.,Corporaal, H. (2012). Minimizing power consumption of spatial division based networks-on-chip using multi-path and frequency reduction. Proceedings - 15th Euromicro Conference on Digital System Design, DSD 2012 : 576-583. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/DSD.2012.85" target="_blank">https://doi.org/10.1109/DSD.2012.85</a> | |
dc.identifier.isbn | 9780769547985 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/70948 | |
dc.description.abstract | With an increasing number of processing elements being integrated on a single die, networks-on-chip (NoCs) are emerging as a significant contributor to overall chip power consumption. While some solutions have been proposed to reduce this power consumption, none of them can be applied to spatial division multiplexing (SDM)-based NoCs. In this paper, we introduce a method to minimize the power consumption of an SDM-based NoC by frequency minimization, while still satisfying the bandwidth requirements. The problem is integrated with the connection-routing problem which is modeled as a mixed-integer quadratic constrained problem (MIQCP). However, solving this MIQCP formulation directly using existing solvers is infeasible for large use-cases. We propose a two-step approach by first computing the minimum feasible frequency for the entire network taking bandwidth of all connections into consideration. This first step reduces the frequency-minimization-routing MIQCP problem into a routing-only mixed-integer linear programming (MILP) problem. In the second step, this MILP problem is solved using a standard ILP solver. Two other techniques are proposed to solve the routing and frequency minimization problem. Experiments are performed with synthetic examples and a case-study with JPEG decoder to evaluate the performance and results of the three methods. MILP-based approach achieves up to 55% power reduction as compared to the other methods albeit at the cost of higher execution time. © 2012 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/DSD.2012.85 | |
dc.source | Scopus | |
dc.subject | mixed integer linear programming | |
dc.subject | Network-on-Chip | |
dc.subject | power minimization | |
dc.subject | routing | |
dc.subject | Spatial division multiplexing | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/DSD.2012.85 | |
dc.description.sourcetitle | Proceedings - 15th Euromicro Conference on Digital System Design, DSD 2012 | |
dc.description.page | 576-583 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.