Evaluations of Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems (Artifact)

Authors Jian-Jia Chen, Georg von der Brüggen, Niklas Ueter



PDF
Thumbnail PDF

Artifact Description

DARTS.4.2.6.pdf
  • Filesize: 470 kB
  • 5 pages

Document Identifiers

Author Details

Jian-Jia Chen
Georg von der Brüggen
Niklas Ueter

Cite As Get BibTex

Jian-Jia Chen, Georg von der Brüggen, and Niklas Ueter. Evaluations of Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems (Artifact). In Special Issue of the 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Dagstuhl Artifacts Series (DARTS), Volume 4, Issue 2, pp. 6:1-6:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/DARTS.4.2.6

Artifact

  MD5 Sum: 6ca9de53b717d130c40c289a82ab61d5 (Get MD5 Sum)

Abstract

This artifact provides the experimental details and implementations of all the 
facilitated schedulability tests used in the reported acceptance ratio based evaluations as documented in the related paper "Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems".

Subject Classification

Keywords
  • global fixed-priority scheduling
  • schedulability analyses
  • speedup bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Theodore P Baker. An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Systems, 32(1-2):49-71, 2006. Google Scholar
  2. Sanjoy K. Baruah and Nathan Fisher. Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In Distributed Computing and Networking, 9th International Conference, ICDCN, pages 215-226, 2008. Google Scholar
  3. Jian-Jia Chen, Georg von der Brüggen, and Niklas Ueter. Push forward: Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In Euromicro Conference on Real-Time Systems, ECRTS, pages 8:1-8:24, 2018. Google Scholar
  4. Paul Emberson, Roger Stafford, and Robert I Davis. Techniques for the synthesis of multiprocessor tasksets. In International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS 2010), pages 6-11, 2010. Google Scholar
  5. Wen-Hung Huang and Jian-Jia Chen. Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors. In International Conference on Real Time Networks and Systems, RTNS, pages 215-224, 2015. Google Scholar
  6. Victor Klee. Can the measure of ∪_i = 1ⁿ [a_i, b_i] be computed in less than O(n log n) steps? The American Mathematical Monthly, 84(4):284-285, 1977. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail