• DocumentCode
    2850297
  • Title

    Is time predictability quantifiable?

  • Author

    Schoeberl, Martin

  • Author_Institution
    Dept. of Inf. & Math. Modeling, Tech. Univ. of Denmark, Lyngby, Denmark
  • fYear
    2012
  • fDate
    16-19 July 2012
  • Firstpage
    333
  • Lastpage
    338
  • Abstract
    Computer architects and researchers in the real-time domain start to investigate processors and architectures optimized for real-time systems. Optimized for real-time systems means time predictable, i.e., architectures where it is possible to statically derive a tight bound of the worst-case execution time. To compare different approaches we would like to quantify time predictability. That means we need to measure time predictability. In this paper we discuss the different approaches for these measurements and conclude that time predictability is practically not quantifiable. We can only compare the worst-case execution time bounds of different architectures.
  • Keywords
    computer architecture; multiprocessing systems; real-time systems; computer architectures; processors; real-time domain; real-time systems; time predictability measurements; worst-case execution time bounds; Computer architecture; Embedded systems; Hardware; Java; Program processors; Real-time systems; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Embedded Computer Systems (SAMOS), 2012 International Conference on
  • Conference_Location
    Samos
  • Print_ISBN
    978-1-4673-2295-9
  • Electronic_ISBN
    978-1-4673-2296-6
  • Type

    conf

  • DOI
    10.1109/SAMOS.2012.6404196
  • Filename
    6404196