Game-theoretic timing analysis

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2008, Pages 575-582

  Seshia, Sanjit A ^a   Rakhlin, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CASE EXECUTIONS; ENVIRONMENT PARAMETERS; ESTIMATION PROBLEMS; HIGH PROBABILITIES; LONGEST PATHS; TIMING ANALYSIS;

COMPUTER AIDED DESIGN; EXPERIMENTS; GAME THEORY; REAL TIME SYSTEMS;

INTEGER PROGRAMMING;

EID: 57849151969     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2008.4681634     Document Type: Conference Paper

References (20)

1. G. Butazzo, Hard real-time computing systems, predictable scheduling algorithms and applications. Kluwer Academic Publishers, 1997.
2. Y.-T. S. Li and S. Malik, Performance Analysis of Real-Time Embedded Software. Kluwer Academic Publishers, 1999.
3. Reinhard Wilhelm et al., "The Determination of Worst-Case Execution Times - Overview of the Methods and Survey of Tools," ACM Transactions on Embedded Computing Systems (TECS), 2007.
4. E. A. Lee, "Computing foundations and practice for cyber-physical systems: A preliminary report," University of California at Berkeley, Tech. Rep. UCB/EECS-2007-72, May 2007.
5. R. Kirner and P. Puschner, "Obstacles in worst-case execution time analysis," in ISORC, 2008, pp. 333-339.
6. X. Li, Y. Liang, T. Mitra, and A. Roychoudhury, "Chronos: A timing analyzer for embedded software," National University of Singapore," Technical Report, 2005, http://www.comp.nus.edu.sg/~rpembed/chronos/chronos- tool.pdf.
7. R. Wilhelm, "Determining Bounds on Execution Times," in Handbook on Embedded Systems, R. Zurawski, Ed. CRC Press, 2005.
8. S. Irani, G. Singh, S. Shukla, and R. Gupta, "An overview of the competitive and adversarial approaches to designing dynamic power management strategies," IEEE Trans. VLSI, vol. 13, no. 12, pp. 1349-1361, Dec 2005.
9. H. Robbins, "Some aspects of the sequential design of experiments," Bull. Amer. Math. Soc., vol. 58, no. 5, pp. 527-535, 1952.
10. N. Cesa-Bianchi and G. Lugosi, Prediction, Learning, and Games. Cambridge University Press, 2006.
11. H. B. McMahan and A. Blum, "Online geometric optimization in the bandit setting against an adaptive adversary," in COLT'04, pp. 109-123.
12. A. György, T. Linder, G. Lugosi, and G. Ottucsák, "The on-line shortest path problem under partial monitoring," J. Mach. Learn. Res., vol. 8, pp. 2369-2403, 2007.
13. B. Awerbuch and R. D. Kleinberg, "Adaptive routing with end-to-end feedback: distributed learning and geometric approaches," in STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2004, pp. 45-53.
14. S. A. Edwards and E. A. Lee, "The case for the precision timed (PRET) machine," in Design Automaton Conference (DAC), 2007, pp. 264.265.
15. F. Nemer, H. Cass, P. Sainrat, J.-P. Bahsoun, and M. D. Michiel, "Papabench: A free real-time benchmark," in 6th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2006. [Online]. Available: http://www.irit.fr/recherches/ARCHI/MARCH/rubrique.php3?id-rubrique=97
16. George Necula et al., "CIL - infrastructure for C program analysis and transformation," http://manju.cs.berkeley.edu/cil/.
17. R. E. Bryant, D. Kroening, J. Ouaknine, S. A. Seshia, O. Strichman, and B. Brady, "Deciding bit-vector arithmetic with abstraction," in TACAS, ser. LNCS, vol. 4424, 2007, pp. 358-372.
18. L. Tan, "The Worst Case Execution Time Tool Challenge 2006: Technical Report for the External Test," UniDUE, Technical Reports of WCET Tool Challenge 1, December 2006. [Online]. Available: http://rw4.cs.uni-sb.de/ ~lili/papers/WCETToolChallenge-ExternalTestRepo%rt-TR.pdf
19. "The Mälardalen benchmark suite." [Online]. Available: http://www.mrtc.mdh.se/projects/wcet/benchmarks.html
20. Todd Austin et al., "The SimpleScalar tool set." [Online]. Available: http://www.simplescalar.com