Efficient implementation selection via time budgeting: complexity analysis and leakage optimization case study

We present time budgeting as an efficient technique for implementation selection. We discuss discreteness in library and present an optimal algorithm for a special case of the problem. The algorithm is extended to construct a heuristic for the general case, and is experimented on the gate-level threshold voltage assignment problem in dual V/sub t/ technology. Experimental results show that our approach reduces the leakage current by close to an order of magnitude, with no or negligible delay penalty. Compared to existing algorithms, our technique outperforms a recent LP-based competitor by 33%.

[1]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, 20th Design Automation Conference Proceedings.

[2]  Qi Wang,et al.  Static power optimization of deep submicron CMOS circuits for dual V/sub T/ technology , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[3]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Majid Sarrafzadeh,et al.  Optimal integer delay budgeting on directed acyclic graphs , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[6]  Malgorzata Marek-Sadowska,et al.  Delay budgeting in sequential circuit with application on FPGA placement , 2003, DAC '03.

[7]  Azadeh Davoodi,et al.  Simultaneous V/sub t/ selection and assignment for leakage optimization , 2005, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Majid Sarrafzadeh,et al.  Scheduling with multiple voltages , 1997, Integr..

[9]  Majid Sarrafzadeh,et al.  A unified theory of timing budget management , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[10]  Endre Boros,et al.  A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs , 1992, IEEE Trans. Computers.

[11]  Majid Sarrafzadeh,et al.  On Computation and Resource Management in Networked Embedded Systems , 2003 .

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  Keshab K. Parhi,et al.  Low power synthesis of dual threshold voltage CMOS VLSI circuits , 1999, Proceedings. 1999 International Symposium on Low Power Electronics and Design (Cat. No.99TH8477).

[14]  Sarma B. K. Vrudhula,et al.  Static power optimization of deep submicron CMOS circuits for dual VT technology , 1998, ICCAD.

[15]  Ankur Srivastava.  Simultaneous Vt selection and assignment for leakage optimization , 2003, ISLPED '03.

[16]  Ravi Nair,et al.  Generation of performance constraints for layout , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  Allen C.-H. Wu,et al.  Delay budgeting for a timing-closure-driven design method , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[18]  Mohamed I. Elmasry,et al.  Power dissipation analysis and optimization of deep submicron CMOS digital circuits , 1996, IEEE J. Solid State Circuits.

[19]  Chunhong Chen,et al.  Power reduction by simultaneous voltage scaling and gate sizing , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[20]  Bing J. Sheu,et al.  BSIM: Berkeley short-channel IGFET model for MOS transistors , 1987 .

[21]  Wei Zhang,et al.  Exploiting VLIW schedule slacks for dynamic and leakage energy reduction , 2001, MICRO.

[22]  Sharad Malik,et al.  Intraprogram dynamic voltage scaling: Bounding opportunities with analytic modeling , 2004, TACO.