Article

Uniprocessor EDF Scheduling with Mode Change

Author:

Björn AnderssonAuthors Info & Claims

OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed Systems

Pages 572 - 577

https://doi.org/10.1007/978-3-540-92221-6_43

Published: 15 December 2008 Publication History

Abstract

Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol and we show that if every mode utilizes at most 50% of the processing capacity then all deadlines are met. We also show that there exists a task set that misses a deadline although the utilization exceeds 50% by just an arbitrarily small amount. Finally, we present, for a relevant special case, an exact schedulability test for EDF with mode change.

References

[1]

Sha, L., Rajkumar, R., Lehoczky, J., Ramamritham, K.: Mode Change Protocol for Priority-Driven Preemptive Scheduling. Carnegie-Mellon University Pittsburgh, Pennsylvania, Software Engineering Institute (November 1988)

Google Scholar

[2]

Dertouzos, M.L.: The Procedural Control of Physical Processes. IFIP Congress, Stockholm, Sweden (1974)

Google Scholar

[3]

Baruah, S., Howell, R., Rosier, L.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems 2, 301-324 (1990)

Crossref

Google Scholar

Cited By

View all

Casini DBiondi AButtazzo G(2019)Handling Transients of Dynamic Real-Time Workload Under EDF SchedulingIEEE Transactions on Computers10.1109/TC.2018.288245168:6(820-835)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1109/TC.2018.2882451
Kloda Td'Ausbourg BSantinelli L(2014)Towards EDF schedulability analysis of an extended timing definition languageACM SIGBED Review10.1145/2692385.269239311:3(44-49)Online publication date: 25-Nov-2014
https://dl.acm.org/doi/10.1145/2692385.2692393
Mitzlaff MKapitza RSchröder-Preikschat WFabre JGuetta OTrapp M(2010)Enabling mode changes in a distributed automotive systemProceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety10.1145/1772643.1772665(75-78)Online publication date: 27-Apr-2010
https://dl.acm.org/doi/10.1145/1772643.1772665

Index Terms

Uniprocessor EDF Scheduling with Mode Change
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Software defect analysis
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Scheduling
    2. Software system structures
      1. Embedded software
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems

The earliest-deadline-first (EDF) policy has been widely studied for the scheduling of real-time jobs for its effectiveness and simplicity. However, since each preemption incurs an additional delay to the execution of jobs, the effectiveness of EDF is ...
Global EDF-based scheduling with laxity-driven priority promotion

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based ...
Uniprocessor EDF scheduling of AVR task systems
ICCPS '15: Proceedings of the ACM/IEEE Sixth International Conference on Cyber-Physical Systems

The adaptive varying-rate (AVR) task model has been proposed as a means of modeling certain physically-derived constraints in CPS's in a manner that is more accurate (less pessimistic) than is possible using prior task models from real-time scheduling ...

Comments

Information & Contributors

Information

Published In

OPODIS '08: Proceedings of the 12th International Conference on Principles of Distributed Systems

December 2008

577 pages

ISBN:9783540922209

Editors:
Theodore P. Baker
Department of Computer Science, Florida State University, Tallahassee, USA FL 32306-4530
,
Alain Bui
Université de Versailles-St-Quentin-en-Yvelines, Versailles Cedex, France 78035
,
Sébastien Tixeuil
LIP6 & INRIA Grand Large, Universitéé Pierre et Marie Curie - Paris 6, Paris, France 75016

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 December 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Casini DBiondi AButtazzo G(2019)Handling Transients of Dynamic Real-Time Workload Under EDF SchedulingIEEE Transactions on Computers10.1109/TC.2018.288245168:6(820-835)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1109/TC.2018.2882451
Kloda Td'Ausbourg BSantinelli L(2014)Towards EDF schedulability analysis of an extended timing definition languageACM SIGBED Review10.1145/2692385.269239311:3(44-49)Online publication date: 25-Nov-2014
https://dl.acm.org/doi/10.1145/2692385.2692393
Mitzlaff MKapitza RSchröder-Preikschat WFabre JGuetta OTrapp M(2010)Enabling mode changes in a distributed automotive systemProceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety10.1145/1772643.1772665(75-78)Online publication date: 27-Apr-2010
https://dl.acm.org/doi/10.1145/1772643.1772665

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems

Global EDF-based scheduling with laxity-driven priority promotion

Uniprocessor EDF scheduling of AVR task systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations