Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling

Abstract : Controlling the number of preemptions in real-time systems is highly desirable in order to achieve an efficient system design in multiple contexts. For example, the delays due to context switches account for high preemption overheads which detrimentally impact the system schedulability. Preemption avoidance can also be potentially used for the efficient control of critical section behaviors in multi-threaded applications. At the same time, modern processor architectures provide for the ability to selectively choose operating frequencies, primarily targeting energy efficiency as well as system performance. In this paper, we propose the use of CPU Frequency Scaling for controlling the preemptive behavior of real-time tasks. We present a framework for selectively eliminating preemptions, that does not require modifications to the task attributes or to the underlying scheduler. We evaluate the proposed approach by four different heuristics through extensive simulation studies.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Christine Rochange <>
Submitted on : Wednesday, December 15, 2010 - 10:28:14 AM
Last modification on : Monday, June 24, 2019 - 10:08:02 AM
Long-term archiving on : Wednesday, March 16, 2011 - 2:52:56 AM


Files produced by the author(s)


  • HAL Id : hal-00546923, version 1



Abhilash Thekkilakattil, Anju Pillai, Radu Dobrin, Sasikumar Punnekkat. Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling. 18th International Conference on Real-Time and Network Systems, Nov 2010, Toulouse, France. pp.129-138. ⟨hal-00546923⟩



Record views


Files downloads