Clustering based fast clock scheduling for light clock-tree

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2001, Pages 240-244

  Saitoh, Makoto ^a   Azuma, Masaaki ^a   Takahashi, Atsushi ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCK INPUT; CLOCK PERIOD; CLOCK SCHEDULE; CLOCK-SCHEDULING; COMPUTATIONAL TIME; INDUSTRIAL DATUM; THEORETICAL MINIMUM; ZERO-SKEW CLOCK;

ALGORITHMS; EXHIBITIONS; WIRE;

CLOCKS;

EID: 0001087019     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2001.915032     Document Type: Conference Paper

References (23)

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, Y. C. Hsu, and J. M. Ho. Zero skew clock net routing. In Proc. 29th DAC, pages 518-523, 1992.
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. Y. Chen, A. B. Kahng, G. Qu, and A. Zelikovsky. The associative-skew clock routing problem. In Proc. 1999 IC-CAD, pages 168-172, 1999.
6. J. Cong, A. B. Kahng, C. K. Koh, and C. W. A. Tsao. Bounded-skew clock and Steiner routing under Elmore delay. In Proc. 1995 ICCAD, pages 66-71, 1995.
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. M. Edahiro. A clustering-based optimization algorithm in zero-skew routings. In Proc. 30th DAC, pages 612-616, 1993.
10. M. Edahiro and T. Yoshimura. Minimum path-length equidistant routing. In Proc. APCCAS 92, pages 41-46, 1992.
11. J. P. Fishburn. Clock skew optimization. IEEE Trans, on Computers, 39(7):945-951, 1990.
12. D. J. H. Huang, A. B. Kahng, and C. W. A. Tsao. On the bounded-skew routing tree problem. In Proc. 32nd DAC, pages 508-513, 1995.
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. I. Kourtev and E. Friedman. Clock skew scheduling for improved reliability via quadratic programming. In Proc. 1999 ICCAD, pages 239-243, 1999.
15. E. L. Lawler. Combinatorial Optimization, Networks and Matroids. Holt, Rinehart and Winston, New York, 1976.
16. X. Liu, M. Papaefthymiou, and E. Friedman. Maximizing performance by retiming and clock skew scheduling. In Proc. 36th DAC, pages 231-236, 1999.
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. A. Takahashi, K. Inoue, and Y Kajitani. Clock-tree routing realizing a clock-schedule for semi-synchronous circuits. In Proc. 1997 ICCAD, pages 260-265, 1997.
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. M. Toyonaga, K. Kurokawa, T. Yasui, and A. Takahashi. A practical clock tree synthesis for semi-synchronous circuits. In Proc. 1SPD'00, 2000.
21. J. G. Xi and W. W. M. Dai. Jitter-tolerant clock routing in two-phase synchronous systems. In Proc. 1996 ICCAD, pages 316-320, 1996.
22. J. G. Xi and W. W. M. Dai. Useful-skew clock routing with gate sizing for low power design. In Proc. 33rd DAC, pages 383-388, 1996.
23. T. Yoda and A. Takahashi. Clock schedule design for minimum realization cost. IEICE Transactions on Fundamentals, E83-A (12): to appear, 2000.