Citation
Jia Zou, Slobodan Matic, John Eidson. "From PTIDES to PtidyOS: Programming Distributed Real-Time Embedded Systems". Talk or presentation, 16, February, 2011.

Abstract
Today, real-time embedded systems are designed using programming models that do not capture timing properties. For example, a language such as C does not allow programmers to specify how long computation takes. This implies the correctness of the system relies on the details of hardware implementation, which effectively means C fails as a proper abstraction for these systems. This thesis describes PTIDES, a programming model that captures both functionality and timing for distributed real-time system. PTIDES delivers temporal semantics by exploiting the discrete-event model of computation. We also introduce a complete workflow built in Ptolemy II that allows application programmers to develop real-time programs as PTIDES models. Taking advantage of the timed semantics in PTIDES, the program will be guaranteed to be deterministic both in functionality as well as timing. More over, the program can be developed, simulated, and verified without the knowledge of worst-case-execution-time(WCET). Our workflow then supports target-specific code generation for an real-time operating system known as PtidyOS. PtidyOS's scheduler combines PTIDES semantics with traditional scheduling methods such as earliest-deadline-first(EDF). PtidyOS performs all event processing in interrupt service routines, while only uses a single stack frame for event execution. We prove our strategy guarantees the event of highest priority will always be able to preempt ones of lower priority even when a single stack frame is used.

Electronic downloads

• p18ZouPTIDESBears2011.pdf · application/pdf · 465 kbytes

• HTML

  Jia Zou, Slobodan Matic, John Eidson. <a
  href="http://chess.eecs.berkeley.edu/pubs/833.html"
  ><i>From PTIDES to PtidyOS: Programming Distributed
  Real-Time Embedded Systems</i></a>, Talk or
  presentation,  16, February, 2011.

• Plain text

  Jia Zou, Slobodan Matic, John Eidson. "From PTIDES to
  PtidyOS: Programming Distributed Real-Time Embedded
  Systems". Talk or presentation,  16, February, 2011.

• BibTeX

  @presentation{ZouMaticEidson11_FromPTIDESToPtidyOSProgrammingDistributedRealTimeEmbedded,
      author = {Jia Zou and Slobodan Matic and John Eidson},
      title = {From PTIDES to PtidyOS: Programming Distributed
                Real-Time Embedded Systems},
      day = {16},
      month = {February},
      year = {2011},
      abstract = {Today, real-time embedded systems are designed
                using programming models that do not capture
                timing properties. For example, a language such as
                C does not allow programmers to specify how long
                computation takes. This implies the correctness of
                the system relies on the details of hardware
                implementation, which effectively means C fails as
                a proper abstraction for these systems. This
                thesis describes PTIDES, a programming model that
                captures both functionality and timing for
                distributed real-time system. PTIDES delivers
                temporal semantics by exploiting the
                discrete-event model of computation. We also
                introduce a complete workflow built in Ptolemy II
                that allows application programmers to develop
                real-time programs as PTIDES models. Taking
                advantage of the timed semantics in PTIDES, the
                program will be guaranteed to be deterministic
                both in functionality as well as timing. More
                over, the program can be developed, simulated, and
                verified without the knowledge of
                worst-case-execution-time(WCET). Our workflow then
                supports target-specific code generation for an
                real-time operating system known as PtidyOS.
                PtidyOS's scheduler combines PTIDES semantics with
                traditional scheduling methods such as
                earliest-deadline-first(EDF). PtidyOS performs all
                event processing in interrupt service routines,
                while only uses a single stack frame for event
                execution. We prove our strategy guarantees the
                event of highest priority will always be able to
                preempt ones of lower priority even when a single
                stack frame is used. },
      URL = {http://chess.eecs.berkeley.edu/pubs/833.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.