datasheets.com EBN.com EDN.com EETimes.com Embedded.com PlanetAnalog.com TechOnline.com  
Events
UBM Tech
UBM Tech
Welcome Guest Log In | Register

Scheduling Fixed-Priority Tasks with Preemption Threshold

Authored on: Dec 15, 2008 by Yun Wang and Manas Saksena

Technical Paper

0 0
More InfoLess Info

While it is widely believed that preemptability is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-versa). In this paper, we use the notion of preemption threshold to develop a new scheduling model, which unifies the concepts of preemptive and non-preemptive scheduling, and subsumes both as special cases.



Please disable any pop-up blockers for proper viewing of this paper.

0 comments
write a comment

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page

×

Please Login

You will be redirected to the login page