ACM Home Page
Please provide us with feedback. Feedback
A fast clock scheduling for peak power reduction in LSI
Full text PdfPdf (193 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 17th ACM Great Lakes symposium on VLSI table of contents
Stresa-Lago Maggiore, Italy
SESSION: Power estimation and modeling table of contents
Pages: 582 - 587  
Year of Publication: 2007
ISBN:978-1-59593-605-9
Authors
Yosuke Takahashi  Tokyo Institute of Technology, Tokyo, Japan
Yukihide Kohira  Tokyo Institute of Technology, Tokyo, Japan
Atsushi Takahashi  Tokyo Institute of Technology, Tokyo, Japan
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1228784.1228921
What is a DOI?

ABSTRACT

The reduction of the peak power consumption of LSI is required to reduce the instability of gate operation, the delay increase, the noise and etc. It is possible to reduce the peak power consumption by clock scheduling because it controls the switching timings of registers and combinational logic elements. In this paper, we propose a fast power estimation method for the clock scheduling and fast clock scheduling methods for the peak power reduction. In experiments, it is shown that the peak power wave estimated by the proposed method in a few seconds is highly correlated with the peak power wave obtained by HSPICE simulation in several days. By using the proposed power estimation method, the proposed clock scheduling method finds clock schedules for benchmark circuits that greatly reduce the peak power in a few minutes.


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
 
2
R. B. Deoker and S. S. Sapatneker. A Graph-Theoretic Approach to Clock Skew Optimization. In ISCAS, pages 407--410, 1994.
 
3
 
4
K. Kurokawa, T. Yasui, Y. Matsumura, M. Toyonaga, and A. Takahashi. A High-Speed and Low-Power Clock Tree Synthesis by Dynamic Clock Scheduling. IEICE Trans. Fundamentals, E85-A(12):2746--2755, 2002.
 
5
 
6
A. Takahashi and Y. Kajitani. Performance and reliability driven clock scheduling of sequential logic circuits. In ASP-DAC'97, pages 37--43, 1997.
 
7

Collaborative Colleagues:
Yosuke Takahashi: colleagues
Yukihide Kohira: colleagues
Atsushi Takahashi: colleagues