Muhammet Mustafa Ozdal
ABSTRACT
Circuit optimization is essential to minimize power consumption of designs while satisfying timing constraints. The CAD problem focused on in the ISPD-2012 Contest is simultaneous gate sizing and threshold voltage assignment. In this paper, we describe an overview of the contest objectives and the provided benchmark suite. Furthermore, some details are provided in terms of the standard cell library, timing models, and the evaluation metrics of the ISPD-2012 Contest.
- M. R. C. M. Berkelaar and J. A. G. Jess. Gate sizing in MOS digital circuits with linear programming. In Proc. of DATE, pages 217--221, 1990. Google Scholar
Digital Library
- C. P. Chen, C. C.-N. Chu, and D. F. Wong. Fast and exact simultaneous gate and wire sizing by Lagrangian relaxation. IEEE Trans. on Computer-Aided Design, 18(7):1014--1025, July 1999. Google ScholarDigital Library
- D. Chinnery and K. Keutzer. Linear programming for sizing, vth and vdd assignment. In Proc. of ISLPED, pages 149--154, 2005. Google ScholarDigital Library
- H. Chou, Y.-H. Wang, and C. C.-P. Chen. Fast and effective gate sizing with multiple-Vt assignment using generalized Lagrangian relaxation. In Proc. of ASPDAC, pages 381--386, 2005. Google ScholarDigital Library
- M. M. Ozdal, S. Burns, and J. Hu. Gate sizing and device technology selection algorithms for high-performance industrial designs. In Proc. of ICCAD, Nov. 2011. Google ScholarDigital Library
- M. Rahman, H. Tennakoon, and C. Sechen. Power reduction via near-optimal library-based cell-size selection. In Proc. of DATE, 2011.Google ScholarCross Ref
- H. Ren and S. Dutt. A network-flow based cell sizing algorithm. In Workshop Notes, Int'l Workshop on Logic Synthesis, 2008.Google Scholar
- S. Roy, W. Chen, C. C.-P. Chen, and Y. H. Hu. Numerically convex forms and their application in gate sizing. IEEE Trans. on Computer-Aided Design, 26(9):1637--1647, Sept. 2007. Google ScholarDigital Library
- H. Tennakoon and C. Sechen. Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step. In Proc. of ICCAD, pages 395--402, 2002. Google ScholarDigital Library
- J. Wang, D. Das, and H. Zhou. Gate sizing by Lagrangian relaxation revisited. IEEE Trans. on Computer-Aided Design, 28(7):1071--1084, July 2009. Google ScholarDigital Library
Index Terms
- The ISPD-2012 discrete cell sizing contest and benchmark suite
Recommendations
The ISPD-2011 routability-driven placement contest and benchmark suite
ISPD '11: Proceedings of the 2011 international symposium on Physical designThe last few years have seen significant advances in the quality of placement algorithms. This is in part due to the availability of large, challenging testcases by way of the ISPD-2005 [17] and ISPD-2006 [16] placement contests. These contests ...
The ISPD2005 placement contest and benchmark suite
ISPD '05: Proceedings of the 2005 international symposium on Physical designWithout the MCNC and ISPD98 benchmarks, it would arguably not have been possible for the academic community to make consistent advances in physical design over the last decade. While still being used extensively in placement and floorplanning research, ...
A Benchmark Suite to Jointly Consider Logic Synthesis and Physical Design
ISPD '15: Proceedings of the 2015 Symposium on International Symposium on Physical DesignThis paper presents an improved benchmark suite to jointly consider logic synthesis and physical design. Usually, benchmark circuits were provided by the physical design and the logic synthesis communities separately, according to their specific needs. ...
Comments