Playing games with scenario- and resource-aware SDF graphs through policy iteration
conference paper
The two-player mean-payoff game is a well-known game theoretic model that is widely used, for instance in economics and control theory. For controller synthesis, a controller is modeled as a player while the environment, or plant, is modeled as the opponent player (adversary). Synthesizing an optimal controller that satisfies a given criterion corresponds to finding a winning strategy for the controller player. Emerging streaming applications (audio, video, communication, etc.) for embedded systems exhibit both input sensitive and controller sensitive runtime behavior, where the controller’s role is runtime management or scheduling. Embedded controllers need to be optimized for dynamic inputs, while guaranteeing throughput constraints. In this paper, we consider this design task for scenario- and resource-aware dataflow graphs that model streaming applications. Scenarios in these models capture classes of dynamic environment behavior. We demonstrate how to model and solve the controller synthesis problem by constructing a
winning strategy in a two-player mean payoff throughput game.
winning strategy in a two-player mean payoff throughput game.
TNO Identifier
954377
ISSN
15301591
ISBN
9783981080186
Publisher
IEEE
Article nr.
6176462
Source title
Proceedings -Design, Automation and Test in Europe, DATE, 15th Design, Automation and Test in Europe Conference and Exhibition, DATE 2012, 12 March 2012 through 16 March 2012
Pages
194-199
Files
To receive the publication files, please send an e-mail request to TNO Repository.