On optimal flip-flop grouping for VLSI power minimization

Shmuel Wimer

doi:10.1016/j.orl.2013.06.002

On optimal flip-flop grouping for VLSI power minimization

Shmuel Wimer

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Technion-Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

Abstract Data-driven clock gating is reducing the total power consumption of VLSI chips by 20%. There, flip-flops are grouped and share a common clock signal. Finding the optimal clusters is the key for maximizing the power savings. Clustering by the minimal cost perfect graph matching algorithm (MCPM) proposed by other works is not optimal. We show that the optimal clustering problem is NP-hard, and study the quality of MCPM heuristics, showing by experiments that it falls 5% above the optimal solution.

Original language	English
Pages (from-to)	486-489
Number of pages	4
Journal	Operations Research Letters
Volume	41
Issue number	5
DOIs	https://doi.org/10.1016/j.orl.2013.06.002
State	Published - 2013

Keywords

Minimum cost perfect matching
NP-hardness
VLSI clock gating
VLSI power optimization

Access to Document

10.1016/j.orl.2013.06.002

Cite this

@article{81e60e6c642040148ee0c7ced4f12519,

title = "On optimal flip-flop grouping for VLSI power minimization",

abstract = "Abstract Data-driven clock gating is reducing the total power consumption of VLSI chips by 20\%. There, flip-flops are grouped and share a common clock signal. Finding the optimal clusters is the key for maximizing the power savings. Clustering by the minimal cost perfect graph matching algorithm (MCPM) proposed by other works is not optimal. We show that the optimal clustering problem is NP-hard, and study the quality of MCPM heuristics, showing by experiments that it falls 5\% above the optimal solution.",

keywords = "Minimum cost perfect matching, NP-hardness, VLSI clock gating, VLSI power optimization",

author = "Shmuel Wimer",

year = "2013",

doi = "10.1016/j.orl.2013.06.002",

language = "אנגלית",

volume = "41",

pages = "486--489",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - On optimal flip-flop grouping for VLSI power minimization

AU - Wimer, Shmuel

PY - 2013

Y1 - 2013

N2 - Abstract Data-driven clock gating is reducing the total power consumption of VLSI chips by 20%. There, flip-flops are grouped and share a common clock signal. Finding the optimal clusters is the key for maximizing the power savings. Clustering by the minimal cost perfect graph matching algorithm (MCPM) proposed by other works is not optimal. We show that the optimal clustering problem is NP-hard, and study the quality of MCPM heuristics, showing by experiments that it falls 5% above the optimal solution.

AB - Abstract Data-driven clock gating is reducing the total power consumption of VLSI chips by 20%. There, flip-flops are grouped and share a common clock signal. Finding the optimal clusters is the key for maximizing the power savings. Clustering by the minimal cost perfect graph matching algorithm (MCPM) proposed by other works is not optimal. We show that the optimal clustering problem is NP-hard, and study the quality of MCPM heuristics, showing by experiments that it falls 5% above the optimal solution.

KW - Minimum cost perfect matching

KW - NP-hardness

KW - VLSI clock gating

KW - VLSI power optimization

UR - https://www.scopus.com/pages/publications/84879805446

U2 - 10.1016/j.orl.2013.06.002

DO - 10.1016/j.orl.2013.06.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84879805446

SN - 0167-6377

VL - 41

SP - 486

EP - 489

JO - Operations Research Letters

JF - Operations Research Letters

IS - 5

ER -

On optimal flip-flop grouping for VLSI power minimization

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this