Process-variation-tolerant clock skew minimization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Process-variation-tolerant clock skew minimization

Full text

Pdf (562 KB)

Source

International Conference on Computer Aided Design archive
Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design table of contents

San Jose, California, United States

Pages: 284 - 288

Year of Publication: 1994

ISBN:0-89791-690-5

Authors

Shen Lin	IBM T.J. Watson Research Center, Yorktown Heights, NY
C. K. Wong	IBM T.J. Watson Research Center, Yorktown Heights, NY

Sponsors

IEEE-CS : Computer Society
SIGDA: ACM Special Interest Group on Design Automation

Publisher

IEEE Computer Society Press Los Alamitos, CA, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 23, Citation Count: 9

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

ABSTRACT

In this paper, we propose a novel hierarchical multiple-merge zero skew clock routing algorithm. The routing results produced by our approach will have zero skew in the nominal case and minimal skew increase in the presence of worst process variations. In order to construct such a clock routing, we formulate the linear placement with maximum spread problem and provide an O(nmin{n,P}lognlogP) algorithm for optimally solving this problem, where n is the number of cells to be placed and P is the maximum spread. Experimental results show that our algorithm can indeed reduce the skew in various manufacturing variations effectively.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Ren-Song Tsay, "Exact Zero Skew," Proc. ICCAD, pp. 336- 339, Nov. 1991.
	2	Ren-Song Tsay, "An Exact Zero-Skew Clock Routing Algorithm," IEEE Trans. on Computer Aided Design, pp. 242-249, Feb. 1993.
	3	T. Chao, Y. Hsu, J. Ho, K. Boose, and A. Kahng, "Zero Skew Clock Routing with Minimum Wirelength," IEEE Trans. on Circuit and Systems, pp. 799-814, Nov. 1992.
	4	Qing Zhu , Wayne Wei-Ming Dai, Perfect-balance planar clock routing with minimal path-length, Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, p.473-476, November 1992, Santa Clara, California, United States
	5	Andrew Kahng , Jason Cong , Gabriel Robins, High-performance clock routing based on recursive geometric matching, Proceedings of the 28th conference on ACM/IEEE design automation, p.322-327, June 17-22, 1991, San Francisco, California, United States [doi>10.1145/127601.127688]
	6	A. L. Fisher and H. T. Kung, "Synchronous large systolic arrays," Proc. SPIE, pp. 44-52, 1982.
	7	S. Dhar, M. A. Franklin and D. F. Wann, "Reduction of clock delays in VLSI structures," Proc. ICCD, pp. 778-783, 1984.
	8	Michael A. B. Jackson , Arvind Srinivasan , E. S. Kuh, Clock routing for high-performance ICs, Proceedings of the 27th ACM/IEEE conference on Design automation, p.573-579, June 24-27, 1990, Orlando, Florida, United States [doi>10.1145/123186.123406]
	9	Barbara Simons, "A Fast Algorithm for Single Processor Scheduling," 19-th Annual Symp. on Foundations of Computer Science, pp. 246-252, Oct. 1978.
	10	Daniel W. Dobberpuhl, et. al. "A 200-MHz 64-b Dual-Issue CMOS Microprocessor", IEEE J. of Solid-State Circuits, pp. 1555-1567, Nov. 1992.

CITED BY 9

	Jason Cong , Andrew B. Kahng , Cheng-Kok Koh , C.-W. Albert Tsao, Bounded-skew clock and Steiner routing, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.3 n.3, p.341-388, July 1998
	Jae W. Chung , De-Yu Kao , Chung-Kuan Cheng , Ting-Ting Lin, Optimization of power dissipation and skew sensitivity in clock buffer synthesis, Proceedings of the 1995 international symposium on Low power design, p.179-184, April 23-26, 1995, Dana Point, California, United States
	Haihua Su , Sachin S. Sapatnekar, Hybrid structured clock network construction, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
	Josè Luis Neves , Eby G. Friedman, Buffered Clock Tree Synthesis with Non-Zero Clock Skew Schedulingfor Increased Tolerance to Process Parameter Variations, Journal of VLSI Signal Processing Systems, v.16 n.2-3, p.149-161, June/July 1997
	Jeng-Liang Tsai , Charlie Chung-Ping Chen, Process-variation robust and low-power zero-skew buffered clock-tree synthesis using projected scan-line sampling, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
	Anand Rajaram , Jiang Hu , Rabi Mahapatra, Reducing clock skew variability via cross links, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
	Anand Rajaram , David Z. Pan , Jiang Hu, Improved algorithms for link-based non-tree clock networks for skew variability reduction, Proceedings of the 2005 international symposium on Physical design, April 03-06, 2005, San Francisco, California, USA
	Bing Lu , Jiang Hu , Gary Ellis , Haihua Su, Process variation aware clock tree routing, Proceedings of the 2003 international symposium on Physical design, April 06-09, 2003, Monterey, CA, USA
	W.-C. D. Lam , J. Jam , C.-K. Koh , V. Balakrishnan , Y. Chen, Statistical based link insertion for robust clock network design, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.588-591, November 06-10, 2005, San Jose, CA