Abstract
Leakage current promises to be a major contributor to power dissipation in future technologies. Bounding the maximum and minimum leakage current poses an important problem. Determining the maximum leakage ensures that the chip meets power dissipation constraints. Applying an input pattern that minimizes leakage allows extending battery life when the circuit is in stand-by mode. Finding such vectors can be expressed as a satisfiability problem. We apply in this paper an incremental SAT solver, PBS [1], to find the minimum or maximum leakage current. The solver is called as a post-process to a randomvector- generation approach. Our results indicate that using a such a generic SAT solver can improve on previously proposed random approaches [7].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Aloul, A. Ramani, I. Markov, K. Sakallah, “PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer,” in Symp. on the Theory and Applications of Satisfiability Testing, 346–353, 2002.
A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu, “Symbolic Model Checking using SAT procedures instead of BDDs,” in Proc. of the Design Automation Conference, 317–320, 1999.
S. Bobba and I. Hajj, “Maximum Leakage Power Estimation for CMOS Circuits,” in Proc. of the IEEE Alessandro Volta Memorial Workshop on Low-Power Design, 1999.
S. Borkar. “Design Challenges of Technology Scaling,” IEEE Micro, 19(4), 23–29, 1999.
M. Davis, G. Logemann, and D. Loveland, “A Machine Program for Theorem Proving,” in Journal of the ACM, (5)7, 394–397, 1962.
C. P. Gomes, B. Selman, and H. Kautz, “Boosting Combinatorial Search Through Randomization,” in Proc. of the National Conference on Artificial Intelligence, 431–447, 1998.
J. Halter and F. Najm, “A gate-level leakage power reduction method for ultra-low-power CMOS circuits,” in Proc. of the IEEE 1997 Custom Integrated Circuits Conference, 475–478, 1997.
M. Johnson, D. Somasekhar, and K. Roy, “Models and Algorithms for Bounds on Leakage in CMOS Circuits,” in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, (18)6, 714–725, 1999.
J. Kao, A. Chandrakasan, D. Anotoniadis, “Transistor Sizing Issues and Tool for Multi-Threshold CMOS Technology,” in Proc. of the Design Automation Conference, 409–414, 1997.
J. Marques-Silva and K. Sakallah, “GRASP: A Search Algorithm for Propositional Satisfiability,” in IEEE Transactions on Computers, (48)5, 506–521, 1999.
MCNC Benchmarks, http://www.cbl.ncsu.edu/CBL_Docs/Bench.html
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, “Chaff: Engineering an Efficient SAT Solver,” in Proc. of the Design Automation Conference, 530–535, 2001.
G. Nam, F. Aloul, K. Sakallah, and R. Rutenbar, “A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints,” in the Proc. of the International Symposium on Physical Design, 222v227, 2001.
S. Narendra, S. Borkar, V. De, and D. Chandrakasan, “Scaling of Stack Effect and its Application for Leakage Reduction,” in Proc. of the Int’l Symp. on Low Power Electronics and Design, 2001.
E. Sentovich and K. Singh and L. Lavagno and C. Moon and R. Murgai and A. Saldanha and H. Savoj and P. Stephan and R. Brayton and A. Sangiovanni-Vincentelli, “SIS: A System for Sequential Circuit Synthesis,” University of California-Berkeley, UCB/ERL M92/ 41, 1992.
L. Silva, J. Silva, L. Silveira and K. Sakallah, “Timing Analysis Using Propositional Satisfiability,” in Proc. of the IEEE International Conference on Electronics, Circuits and Systems, 1998.
S. Sirichotiyakul, T. Edwards, C. Oh, J. Zuo, A. Dharchoudhury, R. Panda, and D. Blaauw, “Stand-by Power Minimization through Simultaneous Threshold Voltage Selection and Circuit Sizing,” in Proc. of the Design Automation Conference, 436–441, 1999.
J. Walsor, “Solving Linear Pseudo-Boolean Constraint Problems with Local Search,” in Proc. of the National Conference on Artificial Intelligence, 1997.
J. Whittemore, J. Kim, and K. Sakallah, “SATIRE: A New Incremental Satisfiability Engine,” in Proc. of the Design Automation Conference, 542–545, 2001.
H. Zhang, “SATO: An Efficient Propositional Prover,” in Proc. of the International Conference on Automated Deduction, 155–160, 1997.
A. Chandrakasan, W. Bowhill, F. Fox eds., “Design of High-Performance Microprocessor Circuits,” Piscataway, NJ: IEEE Press, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aloul, F.A., Hassoun, S., Sakallah, K.A., Blaauw, D. (2002). Robust SAT-Based Search Algorithm for Leakage Power Reduction. In: Hochet, B., Acosta, A.J., Bellido, M.J. (eds) Integrated Circuit Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2002. Lecture Notes in Computer Science, vol 2451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45716-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-45716-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44143-4
Online ISBN: 978-3-540-45716-9
eBook Packages: Springer Book Archive