Citation
Edward A. Lee, Jan Reineke, Michael Zimmer. "Abstract PRET Machines". To appear, Real-Time Systems Symposium, IEEE, 5, December, 2017; Invited TCRTS award paper.

Abstract
Abstract—Prior work has shown that it is possible to design microarchitectures called PRET machines that deliver precise and repeatable timing of software execution without sacrificing performance. That prior work provides specific designs for PRET microarchitectures and compares them against conventional designs. This paper defines a class of microarchitectures called abstract PRET machines (APMs) that capture the essential temporal properties of PRET machines. We show that APMs deliver deterministic timing with no loss of performance for a family of real-time problems consisting of sporadic event streams with deadlines equal to periods. On the other hand, we observe a tradeoff between deterministic timing and the ability to meet deadlines for sporadic event streams with constrained deadlines.

Electronic downloads

• LeeEtAl_AbstractPRET_CameraReady.pdf · application/pdf · 219 kbytes

• HTML

  Edward A. Lee, Jan Reineke, Michael Zimmer. <a
  href="http://chess.eecs.berkeley.edu/pubs/1196.html"
  >Abstract PRET Machines</a>, <em>To
  appear</em>, Real-Time Systems Symposium, IEEE, 5,
  December, 2017; <em>Invited TCRTS award
  paper</em>.

• Plain text

  Edward A. Lee, Jan Reineke, Michael Zimmer. "Abstract
  PRET Machines". <em>To appear</em>,
  Real-Time Systems Symposium, IEEE, 5, December, 2017;
  <em>Invited TCRTS award paper</em>.

• BibTeX

  @inproceedings{LeeReinekeZimmer17_AbstractPRETMachines,
      author = {Edward A. Lee and Jan Reineke and Michael Zimmer},
      title = {Abstract PRET Machines},
      booktitle = {<em>To appear</em>, Real-Time Systems Symposium},
      organization = {IEEE},
      day = {5},
      month = {December},
      year = {2017},
      note = {<em>Invited TCRTS award paper</em>},
      abstract = {Abstract—Prior work has shown that it is
                possible to design microarchitectures called PRET
                machines that deliver precise and repeatable
                timing of software execution without sacrificing
                performance. That prior work provides specific
                designs for PRET microarchitectures and compares
                them against conventional designs. This paper
                defines a class of microarchitectures called
                abstract PRET machines (APMs) that capture the
                essential temporal properties of PRET machines. We
                show that APMs deliver deterministic timing with
                no loss of performance for a family of real-time
                problems consisting of sporadic event streams with
                deadlines equal to periods. On the other hand, we
                observe a tradeoff between deterministic timing
                and the ability to meet deadlines for sporadic
                event streams with constrained deadlines.},
      URL = {http://chess.eecs.berkeley.edu/pubs/1196.html}
  }
  

Posted by Mary Stewart on 29 Sep 2017.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.