A game theoretic approach for power optimization during behavioral synthesis

In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling and binding in behavioral synthesis. The problems are formulated as auction-based noncooperative finite games for which solutions are proposed based on the Nash equilibrium. In the scheduling algorithm, a first-price sealed-bid auction approach is used while, for the binding algorithm, each functional unit in the datapath is modeled as a player bidding for executing an operation with the estimated power consumption as the bid. Further, the techniques of functional unit sharing, path balancing, and register assignment are incorporated within the binding algorithm for power reduction. The combined scheduling and binding algorithm is formulated as a single noncooperative auction game with the functional units in the datapath modeled as players bidding for executing the operation in a particular control cycle. The proposed algorithms yield power reduction without any increase in area overhead and only a slight increase in the latency for some of the benchmark circuits. Experimental results indicate that the proposed game theoretic solution for binding yields an improvement of 13.9% over the linear programming (LP) method, while the scheduling and the combined scheduling and binding algorithms yield average improvements of 6.3% and 11.8%, respectively, over the integer-linear programming (ILP) approach.

[1]  Luca Benini,et al.  System-level power optimization: techniques and tools , 1999, Proceedings. 1999 International Symposium on Low Power Electronics and Design (Cat. No.99TH8477).

[2]  Vamsi K. Srikantam,et al.  CREAM: combined register and module assignment with floorplanning for low power datapath synthesis , 2000, VLSI Design 2000. Wireless and Digital Imaging in the Millennium. Proceedings of 13th International Conference on VLSI Design.

[3]  Sandeep K. Shukla,et al.  A model checking approach to evaluating system level dynamic power management policies for embedded systems , 2001, Sixth IEEE International High-Level Design Validation and Test Workshop.

[4]  C. L. Liu,et al.  An efficient data path synthesis algorithm for behavioral-level power optimization , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[5]  Saraju P. Mohanty,et al.  Simultaneous peak and average power minimization during datapath scheduling , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Ashok Kumar,et al.  Low-power binding of function units in high-level synthesis , 1999, 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356).

[7]  Massoud Pedram,et al.  Register Allocation and Binding for Low Power , 1995, 32nd Design Automation Conference.

[8]  Majid Sarrafzadeh,et al.  Low-power driven scheduling and binding , 1998, Proceedings of the 8th Great Lakes Symposium on VLSI (Cat. No.98TB100222).

[9]  Niraj K. Jha,et al.  SCALP: an iterative-improvement-based low-power data path synthesis system , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Minh N. Do,et al.  Youn-Long Steve Lin , 1992 .

[11]  J. Cortadella,et al.  Scheduling and resource binding for low power , 1995 .

[12]  Krzysztof Kuchcinski,et al.  Operation binding and scheduling for low power using constraint logic programming , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[13]  Daniel D. Gajski,et al.  High ― Level Synthesis: Introduction to Chip and System Design , 1992 .

[14]  Sujit Dey,et al.  Register transfer level power optimization with emphasis on glitch analysis and reduction , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Pierre G. Paulin,et al.  Scheduling and Binding Algorithms for High-Level Synthesis , 1989, 26th ACM/IEEE Design Automation Conference.

[16]  C. Chakrabarti,et al.  ILP-based scheme for low power scheduling and resource binding , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[17]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[18]  Donald F. Ferguson,et al.  Economic models for allocating resources in computer systems , 1996 .

[19]  Massoud Pedram,et al.  Module assignment for low power , 1996, Proceedings EURO-DAC '96. European Design Automation Conference with EURO-VHDL '96 and Exhibition.

[20]  Tim Berners-Lee,et al.  The World-Wide Web , 1994, CACM.

[21]  Ramesh Karri,et al.  Simultaneous scheduling and binding for power minimization during microarchitecture synthesis , 1995, ISLPED '95.

[22]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[23]  Sujit Dey,et al.  A power management methodology for high-level synthesis , 1998, Proceedings Eleventh International Conference on VLSI Design.

[24]  J. Friedman.  Game theory with applications to economics , 1986 .

[25]  Majid Sarrafzadeh,et al.  Simultaneous scheduling, binding and floorplanning for interconnect power optimization , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).