Clustering based fast clock scheduling for light clock-tree

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Clustering based fast clock scheduling for light clock-tree

Full text

Pdf (157 KB)

Source

Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe table of contents

Munich, Germany

Pages: 240 - 245

Year of Publication: 2001

ISBN:0-7695-0993-2

Authors

M. Saitoh	Tokyo Institute of Technology, Department of Communications and Integrated Systems, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan
M. Azuma	Tokyo Institute of Technology, Department of Communications and Integrated Systems, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan
A. Takahashi	Tokyo Institute of Technology, Department of Communications and Integrated Systems, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
ECSI :
IEEE-CS\DATC : IEEE Computer Society
RAS : RAS
EDAC : Electronic Design Automation Consortium
IEEE-CS\TTTC : Test Technology Technical Council
IFIP WG 10.5 : IFIP WG 10.5
EDAA : European Design Automation Association

Publisher

IEEE Press Piscataway, NJ, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 2

Additional Information:

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

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	M. Azuma, M. Saito, and A. Takahashi. A clock-tree routing algorithm for low power using feasible range of clock schedule. SLDM 2000-SLDM-97 (2000-79), Information Processing Society of Japan, 2000. in Japanese.
	2	K. D. Boese and A. B. Kahng. Zero-skew clock routing trees with minimum wirelength. In Proc. IEEE 5th ASIC Conf., pages 1.1.1-1.1.5, 1992.
	3	T.-H. Chao , J.-M. Ho , Y.-C. Hsu, Zero skew clock net routing, Proceedings of the 29th ACM/IEEE conference on Design automation, p.518-523, June 08-12, 1992, Anaheim, California, United States
	4	T. H. Chao, Y. C. Hsu, J. M. Ho, K. D. Boese, and A. B. Kahgn. Zero skew clock routing with minimum wirelength. IEEE Trans. on Circuits and Systems, 39(11):799- 814, 1992.
	5	Yu Chen , Andrew B. Kahng , Gang Qu , Alexander Zelikovsky, The associative-skew clock routing problem, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.168-172, November 07-11, 1999, San Jose, California, United States
	6	Jason Cong , Andrew B. Kahng , Cheng-Kok Koh , C.-W. Albert Tsao, Bounded-skew clock and Steiner routing under Elmore delay, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.66-71, November 05-09, 1995, San Jose, California, United States
	7	J. Cong and C. K. Koh. Minimum-cost bounded-skew clock routing. In Proc. ISCAS 95, volume 1, pages 215-218, 1995.
	8	R. B. Deokar and S. S. Sapatnekar. A graph-theoretic approach to clock skew optimization. In Proc. ISCAS '94, volume 1, pages 407-410, 1994.
	9	Masato Edahiro, A clustering-based optimization algorithm in zero-skew routings, Proceedings of the 30th international conference on Design automation, p.612-616, June 14-18, 1993, Dallas, Texas, United States [doi>10.1145/157485.165066]
	10	M. Edahiro and T. Yoshimura. Minimum path-length equidistant routing. In Proc. APCCAS 92, pages 41-46, 1992.
	11	John P. Fishburn, Clock Skew Optimization, IEEE Transactions on Computers, v.39 n.7, p.945-951, July 1990 [doi>10.1109/12.55696]
	12	Dennis J. H. Huang , Andrew B. Kahng , Chung-Wen Albert Tsao, On the bounded-skew clock and Steiner routing problems, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.508-513, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217579]
	13	K. Inoue, W. Takahashi, A. Takahashi, and Y. Kajitani. Schedule-clock-tree routing for semi-synchronous circuits. IEICE Transactions on Fundamentals, E82-A(11):2431- 2439, 1999.
	14	Ivan S. Kourtev , Eby G. Friedman, Clock skew scheduling for improved reliability via quadratic programming, Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design, p.239-243, November 07-11, 1999, San Jose, California, United States
	15	E. L. Lawler. Combinatorial Optimization, Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
	16	Xun Liu , Marios C. Papaefthymiou , Eby G. Friedman, Maximizing performance by retiming and clock skew scheduling, Proceedings of the 36th ACM/IEEE conference on Design automation, p.231-236, June 21-25, 1999, New Orleans, Louisiana, United States [doi>10.1145/309847.309919]
	17	H. Mitsubayashi, A. Takahashi, and Y. Kajitani. Cost-radius balanced spanning/Steiner trees. IEICE Transactions on Fundamentals, E80-A(4):689-694, 1997.
	18	Atsushi Takahashi , Kazunori Inoue , Yoji Kajitani, Clock-tree routing realizing a clock-schedule for semi-synchronous circuits, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.260-265, November 09-13, 1997, San Jose, California, United States
	19	A. Takahashi and Y. Kajitani. Performance and reliability driven clock scheduling of sequential logic circuits. In Proc. ASP-DAC '97, pages 37-42, 1997.
	20	Masahiko Toyonaga , Keiichi Kurokawa , Takuya Yasui , Atsushi Takahashi, A practical clock tree synthesis for semi-synchronous circuits, Proceedings of the 2000 international symposium on Physical design, p.159-164, May 2000, San Diego, California, United States [doi>10.1145/332357.332393]
	21	Joe G. Xi , Wayne W.-M. Dai, Jitter-tolerant clock routing in two-phase synchronous systems, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.316-320, November 10-14, 1996, San Jose, California, United States
	22	Joe G. Xi , Wayne W.-M. Dai, Useful-skew clock routing with gate sizing for low power design, Proceedings of the 33rd annual conference on Design automation, p.383-388, June 03-07, 1996, Las Vegas, Nevada, United States [doi>10.1145/240518.240592]
	23	T. Yoda and A. Takahashi. Clock schedule design for minimum realization cost. IEICE Transactions on Fundamentals, E83-A(12):to appear, 2000.

CITED BY 2

	Vaibhav Nawale , Thomas W. Chen, Optimal useful clock skew scheduling in the presence of variations using robust ILP formulations, Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, November 05-09, 2006, San Jose, California
	Stephan Held , Bernhard Korte , Jens Maβberg , Matthias Ringe , Jens Vygen, Clock Scheduling and Clocktree Construction for High Performance ASICS, Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design, p.232, November 09-13, 2003