Optimizing controlling-value-based power gating with gate count and switching activity

Lei Chen, Shinji Kimura

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper, a new heuristic algorithm is proposed to optimize the power domain clustering in controlling-value-based (CV-based) power gating technology. In this algorithm, both the switching activity of sleep signals (p) and the overall numbers of sleep gates (gate count, N) are considered, and the sum of the product of p and N is optimized. The algorithm effectively exerts the total power reduction obtained from the CV-based power gating. Even when the maximum depth is kept to be the same, the proposed algorithm can still achieve power reduction approximately 10% more than that of the prior algorithms. Furthermore, detailed comparison between the proposed heuristic algorithm and other possible heuristic algorithms are also presented. HSPICE simulation results show that over 26% of total power reduction can be obtained by using the new heuristic algorithm. In addition, the effect of dynamic power reduction through the CV-based power gating method and the delay overhead caused by the switching of sleep transistors are also shown in this paper.

Original languageEnglish
Pages (from-to)3111-3118
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE92-A
Issue number12
DOIs
Publication statusPublished - 2009 Dec

Fingerprint

Heuristic algorithms
Heuristic algorithm
Sleep
Count
Power Method
Transistors
Optimise
Clustering
Simulation

Keywords

  • Controlling value
  • CV-based power gating
  • Dynamic power reduction
  • Maximum depth constraint
  • Multi-threshold CMOS (MTCMOS)
  • Power gating

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

@article{fc0b340b0b1d4e64bc5ef31f75c12366,
title = "Optimizing controlling-value-based power gating with gate count and switching activity",
abstract = "In this paper, a new heuristic algorithm is proposed to optimize the power domain clustering in controlling-value-based (CV-based) power gating technology. In this algorithm, both the switching activity of sleep signals (p) and the overall numbers of sleep gates (gate count, N) are considered, and the sum of the product of p and N is optimized. The algorithm effectively exerts the total power reduction obtained from the CV-based power gating. Even when the maximum depth is kept to be the same, the proposed algorithm can still achieve power reduction approximately 10{\%} more than that of the prior algorithms. Furthermore, detailed comparison between the proposed heuristic algorithm and other possible heuristic algorithms are also presented. HSPICE simulation results show that over 26{\%} of total power reduction can be obtained by using the new heuristic algorithm. In addition, the effect of dynamic power reduction through the CV-based power gating method and the delay overhead caused by the switching of sleep transistors are also shown in this paper.",
keywords = "Controlling value, CV-based power gating, Dynamic power reduction, Maximum depth constraint, Multi-threshold CMOS (MTCMOS), Power gating",
author = "Lei Chen and Shinji Kimura",
year = "2009",
month = "12",
doi = "10.1587/transfun.E92.A.3111",
language = "English",
volume = "E92-A",
pages = "3111--3118",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Optimizing controlling-value-based power gating with gate count and switching activity

AU - Chen, Lei

AU - Kimura, Shinji

PY - 2009/12

Y1 - 2009/12

N2 - In this paper, a new heuristic algorithm is proposed to optimize the power domain clustering in controlling-value-based (CV-based) power gating technology. In this algorithm, both the switching activity of sleep signals (p) and the overall numbers of sleep gates (gate count, N) are considered, and the sum of the product of p and N is optimized. The algorithm effectively exerts the total power reduction obtained from the CV-based power gating. Even when the maximum depth is kept to be the same, the proposed algorithm can still achieve power reduction approximately 10% more than that of the prior algorithms. Furthermore, detailed comparison between the proposed heuristic algorithm and other possible heuristic algorithms are also presented. HSPICE simulation results show that over 26% of total power reduction can be obtained by using the new heuristic algorithm. In addition, the effect of dynamic power reduction through the CV-based power gating method and the delay overhead caused by the switching of sleep transistors are also shown in this paper.

AB - In this paper, a new heuristic algorithm is proposed to optimize the power domain clustering in controlling-value-based (CV-based) power gating technology. In this algorithm, both the switching activity of sleep signals (p) and the overall numbers of sleep gates (gate count, N) are considered, and the sum of the product of p and N is optimized. The algorithm effectively exerts the total power reduction obtained from the CV-based power gating. Even when the maximum depth is kept to be the same, the proposed algorithm can still achieve power reduction approximately 10% more than that of the prior algorithms. Furthermore, detailed comparison between the proposed heuristic algorithm and other possible heuristic algorithms are also presented. HSPICE simulation results show that over 26% of total power reduction can be obtained by using the new heuristic algorithm. In addition, the effect of dynamic power reduction through the CV-based power gating method and the delay overhead caused by the switching of sleep transistors are also shown in this paper.

KW - Controlling value

KW - CV-based power gating

KW - Dynamic power reduction

KW - Maximum depth constraint

KW - Multi-threshold CMOS (MTCMOS)

KW - Power gating

UR - http://www.scopus.com/inward/record.url?scp=84860879524&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860879524&partnerID=8YFLogxK

U2 - 10.1587/transfun.E92.A.3111

DO - 10.1587/transfun.E92.A.3111

M3 - Article

VL - E92-A

SP - 3111

EP - 3118

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -