A machine learning approach for power gating the FPGA routing network

Power gating is a common approach for reducing circuit static power consumption. In FPGAs, resources that dominate static power consumption lie in the routing network. Researchers have proposed several heuristics for clustering multiplexers in the routing network into power-gating regions. In this paper, we propose a fundamentally different approach based on K-means clustering, an algorithm commonly used in machine learning. Experimental results on Titan benchmarks and Stratix-IV FPGA architecture show that our proposed clustering algorithms outperform the state of the art. For example, for 32 power-gating regions in FPGA routing switch matrices, we achieve (on average) almost 1.4× higher savings (37.48% vs. 26.94%) in the static power consumption of the FPGA routing resources at lower area overhead than the most efficient heuristic published so far.


Published in:
2019 International Conference On Field-Programmable Technology (Icfpt 2019), 10-18
Presented at:
2019 International Conference on Field-Programmable Technology (ICFPT), Tianjin, China, December 9-13, 2019
Year:
Dec 11 2019
Publisher:
Los Alamitos, IEEE COMPUTER SOC
ISBN:
978-1-7281-2943-3
Keywords:
Note:
Best paper award candidate
Laboratories:
PARSA


Note: The status of this file is: Anyone


 Record created 2019-12-20, last modified 2020-10-25

PREPRINT:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)