Citation
Christos Stergiou. "Efficient Schedulability Testing for PTIDES". Talk or presentation, 7, November, 2013; Presented at the 10th Biennial Ptolemy Miniconference, Berkeley.

Abstract
The schedulability problem for a restricted class of Ptides systems with constant delays is reduced to checking feasibility of generalized multiframe tasks. The latter are systems of independent sporadic tasks that release jobs whose execution times, deadlines, and separation times differ across invocations. A pseudo-polynomial algorithm exists for checking feasibility for such task systems. Furthermore, the same reduction is shown to provide a sufficient schedulability test in the case of a richer class of Ptides systems

Electronic downloads

• Stergiou_EfficientSchedulability_PtolemyMConf2013.pdf · application/pdf · 594 kbytes

• HTML

  Christos Stergiou. <a
  href="http://chess.eecs.berkeley.edu/pubs/1032.html"><i>Efficient
  Schedulability Testing for PTIDES</i></a>, Talk
  or presentation,  7, November, 2013; Presented at the <a
  href="http://ptolemy.org/conferences/13" >10th
  Biennial Ptolemy Miniconference</a>, Berkeley.

• Plain text

  Christos Stergiou. "Efficient Schedulability Testing
  for PTIDES". Talk or presentation,  7, November, 2013;
  Presented at the <a
  href="http://ptolemy.org/conferences/13" >10th
  Biennial Ptolemy Miniconference</a>, Berkeley.

• BibTeX

  @presentation{Stergiou13_EfficientSchedulabilityTestingForPTIDES,
      author = {Christos Stergiou},
      title = {Efficient Schedulability Testing for PTIDES},
      day = {7},
      month = {November},
      year = {2013},
      note = {Presented at the <a
                href="http://ptolemy.org/conferences/13" >10th
                Biennial Ptolemy Miniconference</a>, Berkeley.},
      abstract = {The schedulability problem for a restricted class
                of Ptides systems with constant delays is reduced
                to checking feasibility of generalized multiframe
                tasks. The latter are systems of independent
                sporadic tasks that release jobs whose execution
                times, deadlines, and separation times differ
                across invocations. A pseudo-polynomial algorithm
                exists for checking feasibility for such task
                systems. Furthermore, the same reduction is shown
                to provide a sufficient schedulability test in the
                case of a richer class of Ptides systems },
      URL = {http://chess.eecs.berkeley.edu/pubs/1032.html}
  }
  

Posted by Barb Hoversten on 16 Nov 2013.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.