Article

Sustainable Scheduling Analysis

Authors:

Sanjoy Baruah,

Alan BurnsAuthors Info & Claims

RTSS '06: Proceedings of the 27th IEEE International Real-Time Systems Symposium

Pages 159 - 168

https://doi.org/10.1109/RTSS.2006.47

Published: 05 December 2006 Publication History

Publisher Site

Abstract

A schedulability test is defined to be sustainable if any task system deemed schedulable by the test remains so if it behaves "better" than mandated by its system specifications. We provide a formal definition of sustainability, and subject the concept to systematic analysis in the context of the uniprocessor scheduling of periodic and sporadic task systems. We argue that it is in general good engineering practice to use sustainable tests if possible, and classify common uniprocessor schedulability tests according to whether they are sustainable or not.

Cited By

View all

Chaudhari ABaruah S(2022)Efficient Schedulability Analysis of Semi-Clairvoyant Sporadic Task Systems With Graceful DegradationProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534881(116-126)Online publication date: 7-Jun-2022
https://dl.acm.org/doi/10.1145/3534879.3534881
Shen YXiao JPimentel AGrosser TLee K(2022)TCPS: a task and cache-aware partitioned scheduler for hard real-time multi-core systemsProceedings of the 23rd ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems10.1145/3519941.3535067(37-49)Online publication date: 14-Jun-2022
https://dl.acm.org/doi/10.1145/3519941.3535067
Mäki-Turja JHänninen KSjödin M(2021)On Sustainability for Offset Based Response-Time Analysis7th Conference on the Engineering of Computer Based Systems10.1145/3459960.3459969(1-7)Online publication date: 26-May-2021
https://dl.acm.org/doi/10.1145/3459960.3459969
Show More Cited By

Recommendations

EDZL Scheduling Analysis
ECRTS '07: Proceedings of the 19th Euromicro Conference on Real-Time Systems

A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic ...
EDZL scheduling analysis

A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic ...
Sustainable Multiprocessor Scheduling of Sporadic Task Systems
ECRTS '09: Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems

A scheduling policy or a schedulability test is defined to be sustainable with respect to a particular workload model if any task system represented in that model that is determined to be schedulable remains so if it behaves "better" than mandated by ...

Comments

Information & Contributors

Information

Published In

RTSS '06: Proceedings of the 27th IEEE International Real-Time Systems Symposium

December 2006

466 pages

ISBN:0769527612

Publisher

IEEE Computer Society

United States

Publication History

Published: 05 December 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chaudhari ABaruah S(2022)Efficient Schedulability Analysis of Semi-Clairvoyant Sporadic Task Systems With Graceful DegradationProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534881(116-126)Online publication date: 7-Jun-2022
https://dl.acm.org/doi/10.1145/3534879.3534881
Shen YXiao JPimentel AGrosser TLee K(2022)TCPS: a task and cache-aware partitioned scheduler for hard real-time multi-core systemsProceedings of the 23rd ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems10.1145/3519941.3535067(37-49)Online publication date: 14-Jun-2022
https://dl.acm.org/doi/10.1145/3519941.3535067
Mäki-Turja JHänninen KSjödin M(2021)On Sustainability for Offset Based Response-Time Analysis7th Conference on the Engineering of Computer Based Systems10.1145/3459960.3459969(1-7)Online publication date: 26-May-2021
https://dl.acm.org/doi/10.1145/3459960.3459969
Pazzaglia PSun YNatale M(2020)Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic TasksACM Transactions on Embedded Computing Systems10.1145/340488820:1(1-26)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3404888
Zhao YZeng HSangiovanni-Vincentelli ASztipanovits JZhu Q(2019)Optimization techniques for time-critical cyber-physical systemsProceedings of the Workshop on Design Automation for CPS and IoT10.1145/3313151.3313168(41-50)Online publication date: 15-Apr-2019
https://dl.acm.org/doi/10.1145/3313151.3313168
Asyaban SKargahi M(2019)Feasibility Interval for Fixed-Priority Scheduling of Mixed-Criticality Periodic Tasks With OffsetsIEEE Embedded Systems Letters10.1109/LES.2018.282810911:1(17-20)Online publication date: 1-Mar-2019
https://dl.acm.org/doi/10.1109/LES.2018.2828109
Zhao YZeng H(2019)The concept of Maximal Unschedulable Deadline Assignment for optimization in fixed-priority scheduled real-time systemsReal-Time Systems10.1007/s11241-019-09332-055:3(667-707)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s11241-019-09332-0
Awan MSouto PAkesson BBletsas KTovar E(2019)Uneven memory regulation for scheduling IMA applications on multi-core platformsReal-Time Systems10.1007/s11241-018-9322-y55:2(248-292)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s11241-018-9322-y
Fradet PGuo XMonin JQuinton SOuhammou YRidouard FGrolleau EJan MBehnam M(2018)A Generalized Digraph Model for Expressing DependenciesProceedings of the 26th International Conference on Real-Time Networks and Systems10.1145/3273905.3273918(72-82)Online publication date: 10-Oct-2018
https://dl.acm.org/doi/10.1145/3273905.3273918
Kahil RSocci DPoplavko PBensalem SOuhammou YRidouard FGrolleau EJan MBehnam M(2018)Algorithmic Complexity of Correctness Testing in MC-SchedulingProceedings of the 26th International Conference on Real-Time Networks and Systems10.1145/3273905.3273916(180-190)Online publication date: 10-Oct-2018
https://dl.acm.org/doi/10.1145/3273905.3273916
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

EDZL Scheduling Analysis

EDZL scheduling analysis

Sustainable Multiprocessor Scheduling of Sporadic Task Systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations