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

DOI10.1016/J.ORL.2014.05.010MaRDI QIDQ1785247zbMATH OpenOpenAlexFDO

Authors Shmuel Wimer, Doron Gluzer, Uri Wimer

Publication date 28 September 2018

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2014.05.010

zbMATH Keywords

exact coveringmulti-bit flip-flopperfect graph matchingVLSI clockingwell-solvable problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Perfect graphs (05C17)

Recommendations

• Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
• On optimal flip-flop grouping for VLSI power minimization
• Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
• scientific article; zbMATH DE number 1305406
• Upper and lower bounds on switching energy in VLSI

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A well-solvable special case of the bounded knapsack problem
• Another well-solvable case of the QAP: maximizing the job completion time variance
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Efficiently solvable special cases of hard combinatorial optimization problems
• On optimal flip-flop grouping for VLSI power minimization
• Using well-solvable quadratic assignment problems for VLSI interconnect applications
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Cited in

(2)

• Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
• On optimal flip-flop grouping for VLSI power minimization

Describes a project that uses

Uses Software

• Blossom V

This page was built for publication: Using well-solvable minimum cost exact covering for VLSI clock energy minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785247)