Open Access Open Access  Restricted Access Subscription or Fee Access

A Case Study on Various Clock Routing Algorithms

Abhishek Parekh, Shreyas Charola

Abstract


The nature of Clock Tree Synthesis (CTS) in complex hierarchical designs decides timing closure, power dissipation, area of chip and interconnect length. CTS is the process of insertion of buffers or inverters along the clock paths of ASIC design in order to achieve zero/minimum skew or balanced skew. The goal of CTS is to minimize skew and insertion delay. Apart from these, useful skew is also added in the design by means of buffers and inverters. Various clock routing algorithms have been studied in this paper.


Keywords


Clock Tree Synthesis, Physical Design Algorithms, Back-End Design

Full Text:

PDF

References


Jason Cong, Zhigang Pan, Lei He, Cheng-Kok Koh, and Kei-Yong Khoo. Interconnect design for deep submicron ICs. In Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, pages 478–485, 1997.

Ron Ho, Kenneth W. Mai, and Mark A. Horowitz. The future of wires. Proceedings of the IEEE, 89(4):490-504

Qing-Tang Jiang, Ming-Hsing Tsai, and R.H. Havemann. Line width dependence of copper resistivity. In Proceedings of the IEEE 2001 international interconnect technology conference, pages 227–229, 2001.

Semiconductor Industry Association. International technology roadmap for semiconductors 2004 update. World Wide Web, http://www.itrs.net/Common/2004Update/2004Update.htm, 2004.

Semiconductor Industry Association. International technology roadmap for semiconductors 2003 edition. World Wide Web, http://public.itrs.net/Files/2003ITRS/Home2003.htm, 2003.

Martin Eisele, J¨org Berthold, Doris Schmitt-Landsiedel, and Reinhard Mahnkopf. The impact of intra-die device parameter variations on path delays and on the design for yield of low voltage digital circuits. Very Large Scale Integration (VLSI) Systems, IEEE Trans. on, 5(4):352–366, Dec. 1997.

Madhav P. Desai, Radenko Cvijetic, and James Jensen. Sizing of clock distribution networks for high performance cpu chips. In Proceedings of the 33rd annual conference on Design automation, pages 389–394,1996.103

Daniel W. Bailey and Bradley J. Benschneider. Clocking design and analysis for a 600-MHz Alpha microprocessor. IEEE Journal of Solid-State Circuits, 33(11):1627–1633, Nov 1998.

Simon Tam, Stefan Rusu, Utpal Nagarji Desai, Robert Kim, Ji Zhang, and Ian Young. Clock generation and distribution for the first IA-64 microprocessor. IEEE Journal of Solid-State Circuits, 35(11):1545–1552, Nov 2000.

Haihua Su and Sachin S. Sapatnekar. Hybrid structured clock network construction. In Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, pages 333–336, 2001.

Patrick Mahoney, Eric Fetzer, Bruce Doyle, and Sam Naffziger. Clock distribution on a dual-core multithreaded Itanium-family processor. In Digest of technical papers of the 2005 international solid-state circuits conference, pages 292–293, 2005.

R.-S. Tsay. Exact zero skew. In Proceedings of the 1991 IEEE international conference on Computer-aided design, pages 336–339, 1991.

Ting-Hai Chao, Yu-Chin Hsu, Jan-Ming Ho, and A.B. Kahng. Zero skew clock routing with minimum wirelength. Circuits and Systems II: Analog and Digital Signal Processing, 39(11):799–814, Nov. 1992

https://usebackend.wordpress.com/2012/12/03/clock-routing-algorithms/W. D. Doyle, “Magnetization reversal in films with biaxial anisotropy,” in 1987 Proc. INTERMAG Conf., pp. 2.2-1–2.2-6.

Deng, Chao, Yici Cai, and Qiang Zhou. "A register clustering algorithm for low power clock tree synthesis." Circuits and Systems (ISCAS), 2014 IEEE International Symposium on. IEEE, 2014.

Donno, Monica, et al. "Clock-tree power optimization based on RTL clock-gating." Proceedings of the 40th annual Design Automation Conference. ACM, 2003.

Burkis, Joe. "Clock tree synthesis for high performance ASICs." ASIC Conference and Exhibit, 1991. Proceedings. Fourth Annual IEEE International. IEEE, 1991.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.