Using well-solvable minimum cost exact covering for VLSI clock energy minimization

Shmuel Wimer, Doron Gluzer, Uri Wimer

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

To save energy of VLSI systems flip-flops (FFs) are grouped in Multi-Bit Flip-Flop (MBFF), sharing a common clock driver. The energy savings strongly depends the grouping. For 2-bit MBFFs the optimal grouping turns into a minimum cost perfect graph matching problem. For k-bit MBFFs the optimal grouping turns into a minimum cost exact k-covering problem. We show that due to their special setting that is based on the FFs' data toggling probabilities, those problems are well-solvable in O(nlogn) time complexity.

Original languageEnglish
Pages (from-to)332-336
Number of pages5
JournalOperations Research Letters
Volume42
Issue number5
DOIs
StatePublished - Jul 2014

Keywords

  • Exact covering
  • Multi-bit flip-flop
  • Perfect graph matching
  • VLSI clocking
  • Well-solvable problems

Fingerprint

Dive into the research topics of 'Using well-solvable minimum cost exact covering for VLSI clock energy minimization'. Together they form a unique fingerprint.

Cite this