*banner
 

Timing-aware Exceptions for a Precision Timed (PRET) Target
Ben Lickly, Hiren Patel

Citation
Ben Lickly, Hiren Patel. "Timing-aware Exceptions for a Precision Timed (PRET) Target". Talk or presentation, 12, February, 2009.

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

Citation formats  
  • HTML
    Ben Lickly, Hiren Patel. <a
    href="http://chess.eecs.berkeley.edu/pubs/528.html"
    ><i>Timing-aware Exceptions for a Precision Timed
    (PRET) Target</i></a>, Talk or presentation, 
    12, February, 2009.
  • Plain text
    Ben Lickly, Hiren Patel. "Timing-aware Exceptions for a
    Precision Timed (PRET) Target". Talk or presentation, 
    12, February, 2009.
  • BibTeX
    @presentation{LicklyPatel09_TimingawareExceptionsForPrecisionTimedPRETTarget,
        author = {Ben Lickly and Hiren Patel},
        title = {Timing-aware Exceptions for a Precision Timed
                  (PRET) Target},
        day = {12},
        month = {February},
        year = {2009},
        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/528.html}
    }
    

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

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

You are not logged in 
©2002-2017 Chess