*banner
 

To Meet or Not to Meet the Deadline
Jan Reineke, Isaac Liu, Gage Eads, Stephen A. Edwards, Sungjun Kim, Hiren Patel

Citation
Jan Reineke, Isaac Liu, Gage Eads, Stephen A. Edwards, Sungjun Kim, Hiren Patel. "To Meet or Not to Meet the Deadline". Talk or presentation, 16, February, 2011; Presented at the Ninth Biennial Ptolemy Miniconference, Berkeley, CA.

Abstract
Whether or not a program meets its timing constraints depends on the hardware architecture it is running on. The semantics of conventional instruction set architectures (ISA) does not include time. It is impossible to make any statements about the timing of a program written in an ISA without considering a particular hardware implementation of this ISA.

To enable reasoning about timing behavior of programs rather than programs on particular architectures, we propose to endow ISAs with timed semantics, and we introduce ISA extensions, so-called deadline instructions, which enable precise control over timing at the level of nanoseconds. Based on these deadline instructions, we propose higher-level timing constructs in C, which can in turn be used to implement timed models of computation, such as Giotto or PTIDES.

Electronic downloads

Citation formats  
  • HTML
    Jan Reineke, Isaac Liu, Gage Eads, Stephen A. Edwards,
    Sungjun Kim, Hiren Patel. <a
    href="http://chess.eecs.berkeley.edu/pubs/810.html"><i>To
    Meet or Not to Meet the Deadline</i></a>, Talk
    or presentation,  16, February, 2011; Presented at the <a
    href="http://ptolemy.eecs.berkeley.edu/conferences/11"
    >Ninth Biennial Ptolemy Miniconference</a>,
    Berkeley, CA.
  • Plain text
    Jan Reineke, Isaac Liu, Gage Eads, Stephen A. Edwards,
    Sungjun Kim, Hiren Patel. "To Meet or Not to Meet the
    Deadline". Talk or presentation,  16, February, 2011;
    Presented at the <a
    href="http://ptolemy.eecs.berkeley.edu/conferences/11"
    >Ninth Biennial Ptolemy Miniconference</a>,
    Berkeley, CA.
  • BibTeX
    @presentation{ReinekeLiuEadsEdwardsKimPatel11_ToMeetOrNotToMeetDeadline,
        author = {Jan Reineke and Isaac Liu and Gage Eads and
                  Stephen A. Edwards and Sungjun Kim and Hiren Patel},
        title = {To Meet or Not to Meet the Deadline},
        day = {16},
        month = {February},
        year = {2011},
        note = {Presented at the <a
                  href="http://ptolemy.eecs.berkeley.edu/conferences/11"
                  >Ninth Biennial Ptolemy Miniconference</a>,
                  Berkeley, CA.},
        abstract = {Whether or not a program meets its timing
                  constraints depends on the hardware architecture
                  it is running on. The semantics of conventional
                  instruction set architectures (ISA) does not
                  include time. It is impossible to make any
                  statements about the timing of a program written
                  in an ISA without considering a particular
                  hardware implementation of this ISA. <p>To enable
                  reasoning about timing behavior of programs rather
                  than programs on particular architectures, we
                  propose to endow ISAs with timed semantics, and we
                  introduce ISA extensions, so-called deadline
                  instructions, which enable precise control over
                  timing at the level of nanoseconds. Based on these
                  deadline instructions, we propose higher-level
                  timing constructs in C, which can in turn be used
                  to implement timed models of computation, such as
                  Giotto or PTIDES.},
        URL = {http://chess.eecs.berkeley.edu/pubs/810.html}
    }
    

Posted by Christopher Brooks on 18 Feb 2011.
Groups: ptolemy
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