Non-Preemptive Robustness under Reduced System Load

Authors:
Aloysius K. Mok;Wing-Chi Poon
Affiliations:
University of Texas at Austin;University of Texas at Austin
Venue:
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Year:
2005

Citing 0
Cited 4

Robust and sustainable schedulability analysis of embedded software

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

Real-Time Systems
Improving task responsiveness with limited preemptions

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unlike preemptive scheduling policies, non-preemptive real-time scheduling policies can exhibit anomalies even for the single-processor case. In particular, a task set that is schedulable by a non-preemptive scheduler may become unschedulable when the utilization of the task set decreases relative to the CPU speed, e.g., when a faster CPU is used to run the same task set. In this paper, we define the notion of robustness to capture the essence of the scheduling anomaly on real-time system performance. We shall show that it is difficult to test for robustness in general but there are sufficient conditions for guaranteeing robustness.