Title :
Game-theoretic timing analysis
Author :
Seshia, Sanjit A. ; Rakhlin, Alexander
Author_Institution :
EECS Dept., UC, Berkeley, CA
Abstract :
Estimating the worst-case execution time (WCET) of tasks is a key step in the design of reliable real-time software and systems. In this paper, we present a new, game-theoretic approach to estimating WCET based on performing directed measurements on the target platform. We model the estimation problem as a game between our algorithm (player) and the environment of the program (adversary), where the player seeks to find the longest path through the program while the adversary sets environment parameters to thwart the player. We present both theoretical and experimental results demonstrating the utility of our approach. On the theoretical side, we prove that our algorithm can converge to find the longest path with high probability. Experimental results indicate that our approach is competitive with an existing technique based on static analysis and integer programming. Moreover, the approach can be easily applied to even complex hardware/software platforms.
Keywords :
electronic engineering computing; embedded systems; game theory; integer programming; timing; complex hardware-software platforms; game-theoretic timing analysis; integer programming; real-time software; static analysis; worst-case execution time; Algorithm design and analysis; Design methodology; Embedded system; Hardware; Linear programming; Performance evaluation; Predictive models; Real time systems; Software systems; Timing;
Conference_Titel :
Computer-Aided Design, 2008. ICCAD 2008. IEEE/ACM International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
978-1-4244-2819-9
Electronic_ISBN :
1092-3152
DOI :
10.1109/ICCAD.2008.4681634