Please use this identifier to cite or link to this item: https://doi.org/10.1109/DSD.2012.85
DC FieldValue
dc.titleMinimizing power consumption of spatial division based networks-on-chip using multi-path and frequency reduction
dc.contributor.authorWang, S.H.
dc.contributor.authorDas, A.
dc.contributor.authorKumar, A.
dc.contributor.authorCorporaal, H.
dc.date.accessioned2014-06-19T03:18:09Z
dc.date.available2014-06-19T03:18:09Z
dc.date.issued2012
dc.identifier.citationWang, 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.isbn9780769547985
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70948
dc.description.abstractWith 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/DSD.2012.85
dc.sourceScopus
dc.subjectmixed integer linear programming
dc.subjectNetwork-on-Chip
dc.subjectpower minimization
dc.subjectrouting
dc.subjectSpatial division multiplexing
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/DSD.2012.85
dc.description.sourcetitleProceedings - 15th Euromicro Conference on Digital System Design, DSD 2012
dc.description.page576-583
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Mar 29, 2023

Page view(s)

98
checked on Mar 30, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.