Citation
Ben Lickly, Hiren Patel, Edward A. Lee. "Timing-aware Exceptions for a Precision Timed (PRET) Target". Talk or presentation, 16, April, 2009; Poster presented at the 8th Biennial Ptolemy Miniconference .

Abstract
The traditional abstractions used in computer systems only concern themselves with the “functional” aspects of a program. This allows the use of techniques like speculative execution, caches, interrupts, and dynamic compilation that offer improved average-case performance at the expense of predictable execution times. The PRET project aims to improve the timing predictability at all layers of abstraction by carefully reexamining and reworking various architectural and compiler advancements with an eye toward their effects on timing behavior and worst-case bounds.

Electronic downloads

• lickly_miniconf2009_poster.ppt · application/vnd.ms-powerpoint · 1878 kbytes

• HTML

  Ben Lickly, Hiren Patel, Edward A. Lee. <a
  href="http://chess.eecs.berkeley.edu/pubs/573.html"
  ><i>Timing-aware Exceptions for a Precision Timed
  (PRET) Target</i></a>, Talk or presentation, 
  16, April, 2009; Poster presented at the 8th Biennial
  Ptolemy Miniconference
  .

• Plain text

  Ben Lickly, Hiren Patel, Edward A. Lee. "Timing-aware
  Exceptions for a Precision Timed (PRET) Target". Talk
  or presentation,  16, April, 2009; Poster presented at the
  8th Biennial Ptolemy Miniconference
  .

• BibTeX

  @presentation{LicklyPatelLee09_TimingawareExceptionsForPrecisionTimedPRETTarget,
      author = {Ben Lickly and Hiren Patel and Edward A. Lee},
      title = {Timing-aware Exceptions for a Precision Timed
                (PRET) Target},
      day = {16},
      month = {April},
      year = {2009},
      note = {Poster presented at the 8th Biennial Ptolemy
                Miniconference
  },
      abstract = {The traditional abstractions used in computer
                systems only concern themselves with the
                �functional� aspects of a program. This allows
                the use of techniques like speculative execution,
                caches, interrupts, and dynamic compilation that
                offer improved average-case performance at the
                expense of predictable execution times. The PRET
                project aims to improve the timing predictability
                at all layers of abstraction by carefully
                reexamining and reworking various architectural
                and compiler advancements with an eye toward their
                effects on timing behavior and worst-case bounds.},
      URL = {http://chess.eecs.berkeley.edu/pubs/573.html}
  }
  

Posted by Ben Lickly on 18 Apr 2009.
Groups: pret
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.