By Topic

Non-preemptive robustness under reduced system load

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mok, A.K. ; Dept. of Comput. Sci., Texas Univ., Austin, TX ; Wing-Chi Poon

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

Published in:

Real-Time Systems Symposium, 2005. RTSS 2005. 26th IEEE International

Date of Conference:

8-8 Dec. 2005