skip to main content
10.1145/1837274.1837474acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

Efficient smart monte carlo based SSTA on graphics processing units with improved resource utilization

Published:13 June 2010Publication History

ABSTRACT

To exploit the benefits of throughput-optimized processors such as GPUs, applications need to be redesigned to achieve performance and efficiency. In this work, we present techniques to speed up statistical timing analysis on throughput processors. We draw upon advancements in improving the efficiency of Monte Carlo based statistical static timing analysis (MC SSTA) using techniques to reduce the sample size or smart sampling techniques. An efficient smart sampling technique, Stratification + Hybrid Quasi Monte Carlo (SH-QMC), is implemented on a GPU based on NVIDIA CUDA architecture. We show that although this application is based on MC analysis with straightforward parallelism available, achieving performance and efficiency on the GPU requires exposing more parallelism and finding locality in computations. This is in contrast with random sampling based algorithms which are inefficient in terms of sample size but can keep resources utilized on a GPU. We show that SH-QMC implemented on a Multi GPU is twice as fast as a single STA on a CPU for benchmark circuits considered. In terms of an efficiency metric, which measures the ability to convert a reduction in sample size to a corresponding reduction in runtime w.r.t a random sampling approach, we achieve 73.9% efficiency with the proposed approaches compared to 4.3% for an implementation involving performing computations on smart samples in parallel. Another contribution of the paper is a critical graph analysis technique to improve the efficiency of Monte Carlo based SSTA, leading to 2--9X further speedup.

References

  1. C. Visweswariah, et al., "First-Order Incremental Block-Based Statistical Timing Analysis," Proc. Design Automation Conference, pp 331--336, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. Chang, and S. S. Sapatnekar, "Statistical Timing Analysis Considering Spatial Correlations using a Single Pert-Like Traversal," Proc. International Conference on Computer-Aided Design, pp. 621--625, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. K. Chopra, et al., "Parametric yield maximization using gate sizing based on efficient statistical power and delay gradient computation", Proc. International Conference on Computer Aided Design, pp 1023--1028, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. N. Najm, N. Menezes, "Statistical timing analysis based on a timing yield model," Proc. Design Automation Conference, pp. 460--465, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Gandikota, D. Blaauw, D. Sylvester, "Modeling crosstalk in statistical static timing analysis", Proc. Design Automation Conference, pp. 974--979, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. Y. Rubinstein, Simulation and the Monte Carlo Method, John Wiley & Sons, Inc., 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Kanj, R. Joshi, and S. Nassif, "Mixture Importance Sampling and Its Application to the Analysis of SRAM Designs in the Presence of Rare Failure Events," Proc. Design Automation Conference, pp. 69--72, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Singhee and R. A. Rutenbar, "From Finance to Flip Flops: A Study of Fast Quasi-Monte Carlo Methods from Computational Finance Applied to Statistical Circuit Analysis", Proc. ISQED, pp. 685--692, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Singhee, S. Singhal and R. A. Rutenbar, "Practical, fast Monte Carlo statistical static timing analysis: why and how," Proc. International Conference on Computer-Aided Design, pp. 190--195, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Singhee, S. Singhal and R. A. Rutenbar, "Exploiting Correlation Kernels for Efficient Handling of Intra-Die Spatial Correlation, with Application to Statistical Timing," Proc. Design, Automation and Test in Europe, pp. 856--861, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. V. Veetil, D. Sylvester and D. Blaauw, "Efficient Monte Carlo based Incremental Statistical Timing Analysis," Proc. Design Automation Conference, pp. 676--681, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Jaffari, and M. Anis, "On efficient Monte Carlo-based statistical static timing analysis of digital circuits," Proc. International Conference on Computer-Aided Design, pp. 196--203, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. V. Veetil, D. Sylvester, D. Blaauw, S. Shah, and S. Rochel, "Efficient Smart Sampling-Based Full-Chip Leakage Analysis for Intra-Die Variation Considering State Dependence," Design Automation Conference, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. K. Gulati, S. P. Khatri, "Accelerating Statistical Timing Analysis Using Graphics Processing Units", Proc. ASP-DAC, pp. 260--265, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. D. Owens, et al., "GPU Computing" Proceedings of the IEEE, vol. 96(5), pp. 879--899, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  16. http://www.nvidia.com/object/cuda_home.html#Google ScholarGoogle Scholar
  17. J. Xiong et al, "Criticality computation in parameterized statistical timing", Proc. Design Automation Conference, pp. 63--68, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. http://www.nvidia.com/object/product_tesla_s1070_us.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. Efficient smart monte carlo based SSTA on graphics processing units with improved resource utilization

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        DAC '10: Proceedings of the 47th Design Automation Conference
        June 2010
        1036 pages
        ISBN:9781450300025
        DOI:10.1145/1837274

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 June 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,770of5,499submissions,32%

        Upcoming Conference

        DAC '24
        61st ACM/IEEE Design Automation Conference
        June 23 - 27, 2024
        San Francisco , CA , USA

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader