An efficient surface-based low-power buffer insertion algorithm
Proceedings of the 2005 international symposium on Physical design
Post-Layout Gate Sizing for Interconnect Delay and Crosstalk Noise Optimization
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
IEEE Transactions on Computers
A linear programming formulation for security-aware gate sizing
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Reliability-centric gate sizing with simultaneous optimization of soft error rate, delay and power
Proceedings of the 13th international symposium on Low power electronics and design
A fuzzy optimization approach for variation aware power minimization during gate sizing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Proceedings of the Conference on Design, Automation and Test in Europe
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Journal of Combinatorial Optimization
Hi-index | 0.00 |
In this paper, we propose new algorithms for gatesizing and buffer insertion that aim at reducing the switchedcapacitance in gate level circuits. We have formulated the gatesizing and the buffer insertion problems as competitive resourceallocation based auction theoretic games and develop solutionsbased on the Nash equilibrium function. The main contributionof this work is in the application of economic models andgame theoretic solutions to logic synthesis problems for poweroptimization. The gate sizing problem is modeled as a ProgressiveSecond Price (PSP) auction, where the players of the auction(representing the gates) bid for partial delays in each path ofthe circuit. The PSP auction process attempts to optimize thepower consumption of each path in the circuit. The bids suppliedby the players are used to determine the allocation for eachplayer in the auction, using a game theoretic formulation. Thesize of a gate is determined based on its delay allocation. The gatesizing problem can be integrated with buffer insertion for betterpower optimization and we develop a game theoretic algorithmfor combined gate sizing and buffer insertion. Experimentalresults on MCNC '91 benchmark circuits indicate that theproposed algorithms provide better power optimization thansimilar approaches in the literature, and are comparable in termsof run times.