Citation
Maarten Wiggers, Marco Bekooij, Gerard Smit. "Monotonicity and Run-Time Scheduling". Talk or presentation, 11, February, 2010; Poster presented at the 2010 Berkeley EECS Annual Research Symposium (BEARS).

Abstract
Modern embedded multi-processors can execute several stream processing applications concurrently. Typically, these applications are partitioned into tasks that communicate over buffers together forming a task graph. The fact that these applications are started and stopped by the user combined with the knowledge that not all applications are necessarily completely characterised makes it attractive to use run-time scheduling. We define and characterise a class of budget schedulers that by construction bound the interference from other applications. Furthermore, we will show that the worst-case effects of these schedulers can be included in dataflow process networks. The execution of the resulting dataflow process network is shown to result in tight and conservative bounds on the end-to-end temporal behaviour of the execution of the task graph on a cycle-true simulator. Given that the inter-task synchronisation of the application allows for a dataflow model that is functionally deterministic, this enables exploration of various buffer capacities and scheduler settings at a high level of abstraction.

Electronic downloads

• poster_bears2010.pdf · application/pdf · 416 kbytes

• HTML

  Maarten Wiggers, Marco Bekooij, Gerard Smit. <a
  href="http://chess.eecs.berkeley.edu/pubs/659.html"><i>Monotonicity
  and Run-Time Scheduling</i></a>, Talk or
  presentation,  11, February, 2010; Poster presented at the
  2010 <a
  href="http://www.eecs.berkeley.edu/BEARS"
  >Berkeley EECS Annual Research Symposium
  (BEARS)</a>.

• Plain text

  Maarten Wiggers, Marco Bekooij, Gerard Smit.
  "Monotonicity and Run-Time Scheduling". Talk or
  presentation,  11, February, 2010; Poster presented at the
  2010 <a
  href="http://www.eecs.berkeley.edu/BEARS"
  >Berkeley EECS Annual Research Symposium
  (BEARS)</a>.

• BibTeX

  @presentation{WiggersBekooijSmit10_MonotonicityRunTimeScheduling,
      author = {Maarten Wiggers and Marco Bekooij and Gerard Smit},
      title = {Monotonicity and Run-Time Scheduling},
      day = {11},
      month = {February},
      year = {2010},
      note = {Poster presented at the 2010 <a
                href="http://www.eecs.berkeley.edu/BEARS"
                >Berkeley EECS Annual Research Symposium
                (BEARS)</a>.},
      abstract = {Modern embedded multi-processors can execute
                several stream processing applications
                concurrently. Typically, these applications are
                partitioned into tasks that communicate over
                buffers together forming a task graph. The fact
                that these applications are started and stopped by
                the user combined with the knowledge that not all
                applications are necessarily completely
                characterised makes it attractive to use run-time
                scheduling. We define and characterise a class of
                budget schedulers that by construction bound the
                interference from other applications. Furthermore,
                we will show that the worst-case effects of these
                schedulers can be included in dataflow process
                networks. The execution of the resulting dataflow
                process network is shown to result in tight and
                conservative bounds on the end-to-end temporal
                behaviour of the execution of the task graph on a
                cycle-true simulator. Given that the inter-task
                synchronisation of the application allows for a
                dataflow model that is functionally deterministic,
                this enables exploration of various buffer
                capacities and scheduler settings at a high level
                of abstraction.},
      URL = {http://chess.eecs.berkeley.edu/pubs/659.html}
  }
  

Posted by Maarten Wiggers on 13 Feb 2010.
Groups: ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.