Chien Pang Lu
ABSTRACT
To shorten the time-to-market and reduce the expensive cost of photomasks in advance process technologies, metal-only ECO has become a practical and attractive solution to handle incremental design changes. Due to limited spare cells in metal-only ECO, the new added netlist may often violate the input-slew and outputloading constraints and, in turn, delay or even fail the timing closure. This paper proposes a framework, named MOESS, to solve the input-slew and output-loading violations by connecting spare cells onto the violated nets as buffers. MOESS provides two buffer insertion schemes performed sequentially to minimize the number of inserted buffers and then to solve timing violations if there is any. This framework has been silicon-validated through industrial designs with more than 1-million instances. The experimental results demonstrate that MOESS can solve more violations with less inserted buffers and less CPU runtime compared to an EDA vendor's solution. The whole framework is built based on a commercial APR tool and can be ported to any other APR tool offering open access to its design database.
- Cadence design system. http://www.cadence.com/.Google Scholar
- International technology roadmap for semiconductors. http://www.itrs.net/.Google Scholar
- Magma design automation. http://www.magma-da.com/.Google Scholar
- Synopsys inc. http://www.synopsys.com/.Google Scholar
- C. Alpert, A. Kahng, B. Liu, I. Mandoiu, and A. Zelikovshy. Minimum-buffered routing of non-critical nets for slew rate and reliability control. In ACM/IEEE Int'l Conference on Computer Aided Design, pages 408--415, 2001. Google ScholarDigital Library
- A. Balasinski. Optimization of sub-100-nm designs for mask cost reduction. J. Microlithography, Microfabrication, Microsyst., 3:322--331, Apr. 2004.Google Scholar
- Y. P. Chen, J. W. Fang, and Y. W. Chang. Eco timing optimization using spare cells and technology remapping. In ACM/IEEE Int'l Conference on Computer Aided Design, pages 530--535, Nov. 2007. Google ScholarDigital Library
- J. Cong, J. Fang, and K. Khoo. An implicit connection graph maze routing algorithm for eco routing. In ACM/IEEE Int'l Conference on Computer Aided Design, pages 163--167, Nov. 1999. Google ScholarDigital Library
- S. Dutt and H. Arslan. Efficient timing-driven incremental routing for vlsi ciruits using dfs and localized slack-satisfaction computations, 2006. Google ScholarDigital Library
- S. Hu, C. J. Alpert, J. Hu, S. Karandikar, Z. Li, W. Shi, and C. Sze. Fast algorithm for slew-constrained minimum cost buffering. In Design Automation Conference, pages 308--313, 2006. Google ScholarDigital Library
- Y. M. Kuo, Y. T. Chang, S. C. Chang, and M. M. Sadowska. Engineering change using spare cells with constant insertion. In ACM/IEEE Int'l Conference on Computer Aided Design, pages 544--547, Nov. 2007. Google ScholarDigital Library
- Y. L. Li, J. Y. Li, and W. B. Chen. An efficient tile-based eco router using routing graph reduction and enhanced global routing flow, Feb. 2007. Google ScholarDigital Library
- P. Osler. Placement driven synthesis case studies on two sets of two chips: hierarchical and flat. In ACM Int'l Symposium on Physical Design, pages 190--197, 2004. Google ScholarDigital Library
- S. M. Sait and H. Youssef, 1999.Google Scholar
- P. Saxena, N. Menezes, and P. C. an D. A. Kirkpatrick. Repeater scaling and its impact on cad, 2004.Google Scholar
- W. shi and Z. Li. Fast algorithm for optimal buffer insertion, 2005. Google ScholarDigital Library
Index Terms
- A metal-only-ECO solver for input-slew and output-loading violations
Recommendations
A metal-only-ECO solver for input-slew and output-loading violations
To reduce the time-to-market and photomask cost for advanced process technologies, metal-only engineering change order (ECO) has become a practical and attractive solution to handle incremental design changes. Due to limited spare cells in metal-only ...
A fast general slew constrained minimum cost buffering algorithm
As VLSI technology moves to the nanoscale regime, ultra-fast slew buffering techniques considering buffer cost minimization are highly desirable. The existing technique proposed in [S. Hu, C. Alpert, J. Hu, S. Karandikar, Z. Li, W. Shi, C.-N. Sze, Fast ...
Fast algorithms for slew constrained minimum cost buffering
DAC '06: Proceedings of the 43rd annual Design Automation ConferenceAs a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techniques to handle large volume of nets, while also minimizing buffering ...
Comments