Using well-solvable minimum cost exact covering for VLSI clock energy minimization
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 group...
Gespeichert in:
Veröffentlicht in: | Operations research letters 2014-07, Vol.42 (5), p.332-336 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0167-6377 1872-7468 |
DOI: | 10.1016/j.orl.2014.05.010 |