Fast multi-domain clock skew scheduling for peak current reduction

  • Authors:
  • Shih-Hsu Huang;Chia-Ming Chang;Yow-Tyng Nieh

  • Affiliations:
  • Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.;Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.;Chung Yuan Christian University, Chung Li, Taiwan, R.O.C.

  • Venue:
  • ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given several specific clocking domains, the peak current minimization problem can be formulated as a 0-1 integer linear program. However, if the number of binary variables is large, the run time is unacceptable. In this paper, we study the reduction of this high computational expense. Our approach includes the following two aspects. First, we derive the ASAP schedule and the ALAP schedule to prune the redundancies without sacrificing the exactness (optimality) of the solution. Second, we propose a zone-based scheduling algorithm to solve a large circuit heuristically.