Provided by: University of Missouri-St. Louis
Date Added: May 2009
Limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and non-preemptive scheduling. In particular, allowing preemption to occur only at predefined preemption points reduces context switch costs, simplifies the access to shared resources, and allows more predictable estimations of worst-case execution times. Current results related to such a model, however, exhibit two major deficiencies: the exact response time analysis is too complex and the maximum lengths of the non-preemptive regions for each task are still unknown.