Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5349))

Abstract

Power distribution systems provide the voltages and currents that devices in a circuit need to operate properly and silicon success requires its careful design and verification. However, problems like voltage drop, ground bounce and electromigration, which may cause chip failures, are worsening, as more devices, operating at higher frequencies, are placed closer together. Verification of this type of systems is usually done by simulation, a costly endeavor given the size of current grids, making the determination of the worst-case input setting a crucial task. Current methodologies are based on supposedly safe settings targeting either unrealistic simultaneous switching on all signals or heuristic accounts of the joint switching probability of nearby signals. In this paper we propose a methodology for computation of the worst-case stimuli for power grid analysis. This is accomplished by determining the input vector that maximizes the number of gates, in close proximity to each other, that can switch in a given time window. The addition of these temporal and spatial restrictions makes the solution of the underlying optimization problem feasible. Comparisons with existing alternatives show that only a fraction of the gates change in any given timing window, leading to a more robust and efficient verification methodology.

This research was supported in part by the Portuguese FCT under program POSI, ref. EEA-ESE/61528/2004.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Power grid verification. Whitepaper, Cadence Design Systems, Inc. (2001)

    Google Scholar 

  2. Nassif, S.R., Kozhaya, J.N.: Fast power grid simulation. In: Proc. of ACM/IEEE Design Automation Conf (DAC), ACM/IEEE, pp. 156–161 (June 2000)

    Google Scholar 

  3. Zhong, Y., Wong, M.D.F.: Fast algorithms for ir drop analysis in large power grid. In: ICCAD 2005: Proceedings of the 2005 IEEE/ACM Int. conference on Computer-aided design, pp. 351–357. IEEE Computer Society, Los Alamitos (2005)

    Chapter  Google Scholar 

  4. Chai, D., Kuehlmann, A.: Circuit-based preprocessing of ilp and its applications in leakage minimization and power estimation. In: IEEE Int. Conference on Computer Design: VLSI in Computers and Processors, pp. 387–392. IEEE, Los Alamitos (2004)

    Google Scholar 

  5. Kriplani, H., Najm, F.N., Hajj, I.N.: Pattern independent maximum current estimation in power and ground buses of cmos vlsi circuits: algorithms, signal correlations, and their resolution. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14(8), 998–1012 (1995)

    Article  Google Scholar 

  6. Mangassarian, H., Veneris, A., Safarpour, S., Najm, F.N., Abadir, M.S.: Maximum circuit activity estimation using pseudo-boolean satisfiability. In: Proc. of Design, Automation and Test in Europe conference (DATE), pp. 1538–1543 (April 2007)

    Google Scholar 

  7. Ghosh, A., Devadas, S., Keutzer, K., White, J.: Estimation of Average Switching Activity in Combinational and Sequential Circuits. In: Proceedings of the 29th Design Automation Conference, pp. 253–259 (June 1992)

    Google Scholar 

  8. Manquinho, V., Marques-Silva, J.: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. In: Proc. of Design, Automation and Test in Europe conference (DATE) (March 2005)

    Google Scholar 

  9. Een, N., Sorensson, N.: An Extensible SAT-solver. Theory and Applications of Satisfiability Testing 2919, 502–518 (2004)

    Article  MATH  Google Scholar 

  10. Breuer, M., Friedman, A.: 4. In: Diagnosis and Reliable Design of Digital Systems, Computer Science Press (1976)

    Google Scholar 

  11. Monteiro, J., Rinderknecht, J., Devadas, S., Ghosh, A.: Optimization of Combinational and Sequential Logic Circuits for Low Power Using Precomputation. In: Proceedings of the 1995 Chapel Hill Conference on Advanced Research on VLSI, pp. 430–444 (March 1995)

    Google Scholar 

  12. Flores, P., Neto, H., Marques-Silva, J.: An Exact Solution to the Minimum Size Test Pattern Problem. ACM Transactions on Design Automation of Electronic Systems 6(4), 629–644 (2001)

    Article  Google Scholar 

  13. Barth, P.: A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical report, Max-Planck-Institut Fűr Informatik (January 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morgado, P.M., Flores, P.F., Monteiro, J.C., Silveira, L.M. (2009). Generating Worst-Case Stimuli for Accurate Power Grid Analysis. In: Svensson, L., Monteiro, J. (eds) Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation. PATMOS 2008. Lecture Notes in Computer Science, vol 5349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95948-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95948-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95947-2

  • Online ISBN: 978-3-540-95948-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics