Abstract
Optimizations developed in earlier chapters affect many aspects of physical synthesis, but often target sequential elements, which particularly impact circuit performance. In order to obtain synergies between these optimizations, we explore the infrastructure for physical synthesis used by IBM for large commercial microprocessor designs. We focus our attention on a very challenging high-performance design style called large-block synthesis (LBS). In such designs latch placement is critical to the performance of the clock network, which in turn affects chip timing and power. Our research uncovers deficiencies in the state-of-the-art physical synthesis flow vis-à-vis latch placement that result in timing disruptions and hamper design closure. We introduce a next-generation EDA methodology that improves timing closure through careful latch placement and clock-network routing to (i) avoid timing degradation where possible, and (ii) immediately recover from unavoidable timing disruptions. When evaluated on large CPU designs recently developed at IBM, our methodology leads to double-digit improvements in key circuit parameters, compared to IBMs prior state-of-the-art methodologies.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In state-of-the-art flows, placement can be invoked several times following optimization.
- 2.
Before LCB cloning, all latches on the chip are driven by a single LCB with very high fanout, resulting in very different latencies between different corners of the chip.
References
International technology roadmap for semiconductors, 2009 edition. [Online]. http://www.itrs.net/
Cheon Y, Ho P-H, Kahng AB, Reda S, Wang Q (2005) Power-aware placement. In: Proceedings of DAC, pp 795–800
Vygen J (1997) Algorithms for large-scale flat placement. In: Proceedings of DAC , pp 746–751
Roy JA, Papa DA, Markov IL (2008) Fine control of local whitespace in placement, VLSI design, 2008:10, Article 517919. doi:10.1155/2008/517919
Selim SZ, Ismail MA (1984) K-Means-Type algorithms: a generalized convergence theorem and characterization of local optimality. PAMI 6(1):81–87
Viswanathan N, Chu C (2005) FastPlace: efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model. IEEE Trans. on CAD 24(5):722–733
Viswanathan N, Pan M, Chu C (2006) FastPlace 2.0: an efficient analytical placer for mixed-mode designs. In: Proceedings of ASP-DAC , pp 195–200
Viswanathan N, Pan M, Chu C (2007) FastPlace 3.0: a fast multilevel quadratic placement algorithm with placement congestion control. In: Proceedings of ASP-DAC, pp 135–140
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Papa, D.A., Markov, I.L. (2013). Co-Optimization of Latches and Clock Networks . In: Multi-Objective Optimization in Physical Synthesis of Integrated Circuits. Lecture Notes in Electrical Engineering, vol 166. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1356-1_9
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1356-1_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1355-4
Online ISBN: 978-1-4614-1356-1
eBook Packages: EngineeringEngineering (R0)