scholarly journals A Game-Theoretic Approach for Run-Time Distributed Optimization on MP-SoC

2008 ◽  
Vol 2008 ◽  
pp. 1-11 ◽  
Author(s):  
Diego Puschini ◽  
Fabien Clermidy ◽  
Pascal Benoit ◽  
Gilles Sassatelli ◽  
Lionel Torres

With forecasted hundreds of processing elements (PEs), future embedded systems will be able to handle multiple applications with very diverse running constraints. Systems will integrate distributed decision capabilities. In order to control the power and temperature, dynamic voltage frequency scalings (DVFSs) are applied at PE level. At system level, it implies to dynamically manage the different voltage/frequency couples of each tile to obtain a global optimization. This paper introduces a scalable multiobjective approach based on game theory, which adjusts at run-time the frequency of each PE. It aims at reducing the tile temperature while maintaining the synchronization between application tasks. Results show that the proposed run-time algorithm requires an average of 20 calculation cycles to find the solution for a 100-processor platform and reaches equivalent performances when comparing with an offline method. Temperature reductions of about 23% were achieved on a demonstrative test-case.

Author(s):  
Tomonori Honda ◽  
Francesco Ciucci ◽  
Kemper Lewis ◽  
Maria C. Yang

Frameworks for modeling the communication and coordination of subsystem stakeholders are valuable for the synthesis of large engineering systems. However, these frameworks can be resource intensive and challenging to implement. This paper compares three frameworks, Multidisciplinary Design Optimization (MDO), traditional Game Theory, and a Modified Game Theoretic approach on the form and flow of information passed between subsystems. This paper considers the impact of “complete” information sharing by determining the effect of merging subsystems. Comparisons are made of convergence time and robustness in a case study of the design of a satellite. Results comparing MDO in two- and three-player scenarios indicate that, when the information passed between subsystems is sufficiently linear, the two scenarios converge in statistically indifferent number of iterations, but additional “complete” information does reduce variability in the number of iterations. The Modified Game Theoretic approach converges to a smaller region of the Pareto set compared to MDO, but does so without a system facilitator. Finally, a traditional Game Theoretic approach converges to a limit cycle rather than a fixed point for the given initial design. There may also be a region of attraction for convergence for a traditional Game Theoretic approach.


1982 ◽  
Vol 55 (3) ◽  
pp. 367 ◽  
Author(s):  
Carl Alan Batlin ◽  
Susan Hinko

Sign in / Sign up

Export Citation Format

Share Document