A game theoretic approach for power optimization during behavioral synthesis.

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 equilibri...

Full description

Bibliographic Details
Published in:IEEE Transactions on VLSI systems 11, 6 (2003).
Main Author: Murugavel, A.K
Format: Article
Language:English
Subjects:
LP.
Nash equilibrium.
Average power optimisation.
Behavioral synthesis.
Benchmark circuits.
Binding algorithms.
Combined scheduling.
Control cycle.
Finite games.
First-price sealed-bid auction.
Game theory.
Integer-linear programming.
Player bidding.
Power consumption.
Scheduling.
Single noncooperative auction game.
Yield power reduction.