On the Schedulability of Real-Time Discrete-Event Systems
Eleftherios Matsikoudis, Christos Stergiou, Edward A. Lee

Citation
Eleftherios Matsikoudis, Christos Stergiou, Edward A. Lee. "On the Schedulability of Real-Time Discrete-Event Systems". 13th International Conference on Embedded Software (EMSOFT), 2013.

Abstract
We consider end-to-end latency specifications for hard real-time embedded systems. We introduce a discrete-event programming model generalizing such specifications, and address its schedulability problem for uniprocessor systems. This turns out to be rather idiosyncratic, involving complex, time-dependent release predicates and precedence constraints, quite unlike anything we have seen in the hard real-time computing literature. We prove the optimality of the earliest-deadline-first scheduling policy, and provide an algorithmic solution, reducing the schedulability problem to a reachability problem for timed automata.

Electronic downloads

(No downloads are available for this publication.)

Citation formats

• HTML

  Eleftherios Matsikoudis, Christos Stergiou, Edward A. Lee.
  <a
  href="http://chess.eecs.berkeley.edu/pubs/1000.html"
  >On the Schedulability of Real-Time Discrete-Event
  Systems</a>, 13th International Conference on Embedded
  Software (EMSOFT), 2013.

• Plain text

  Eleftherios Matsikoudis, Christos Stergiou, Edward A. Lee.
  "On the Schedulability of Real-Time Discrete-Event
  Systems". 13th International Conference on Embedded
  Software (EMSOFT), 2013.

• BibTeX

  @inproceedings{MatsikoudisStergiouLee13_OnSchedulabilityOfRealTimeDiscreteEventSystems,
      author = {Eleftherios Matsikoudis and Christos Stergiou and
                Edward A. Lee},
      title = {On the Schedulability of Real-Time Discrete-Event
                Systems},
      booktitle = {13th International Conference on Embedded Software
                (EMSOFT)},
      year = {2013},
      abstract = {We consider end-to-end latency specifications for
                hard real-time embedded systems. We introduce a
                discrete-event programming model generalizing such
                specifications, and address its schedulability
                problem for uniprocessor systems. This turns out
                to be rather idiosyncratic, involving complex,
                time-dependent release predicates and precedence
                constraints, quite unlike anything we have seen in
                the hard real-time computing literature. We prove
                the optimality of the earliest-deadline-first
                scheduling policy, and provide an algorithmic
                solution, reducing the schedulability problem to a
                reachability problem for timed automata. },
      URL = {http://chess.eecs.berkeley.edu/pubs/1000.html}
  }
  

Posted by Christos Stergiou on 16 Jul 2013.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.