You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

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

Fulltext:


Authors:

Abhilash Thekkilakattil, Anju S Pillai, Radu Dobrin, Sasikumar Punnekkat

Research group:

Dependable Software Engineering

Publication Type:

Conference/Workshop Paper

Venue:

The 18th International Conference on Real-Time and Network Systems

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.

Bibtex

@inproceedings{Thekkilakattil1923,
author = {Abhilash Thekkilakattil and Anju S Pillai and Radu Dobrin and Sasikumar Punnekkat},
title = {Reducing the Number of Preemptions in Real-Time Systems Scheduling by CPU Frequency Scaling},
month = {November},
year = {2010},
booktitle = {The 18th International Conference on Real-Time and Network Systems},
url = {http://www.es.mdu.se/publications/1923-}
}