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

Towards Exploiting Limited Preemptive Scheduling for Partitioned Multicore Systems

Authors:

Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat

Research group:

Dependable Software Engineering

Publication Type:

Conference/Workshop Paper

Venue:

The 8th Junior Researcher Workshop on Real-Time Computing

Abstract

Limited-preemptive scheduling has gained popularity due to their ability to guarantee predictable behaviors with respect to preemption overheads on uniprocessors, e.g., minimize cache related preemption delays. However, only few techniques exist that extend limited-preemptive scheduling to multicore systems where the challenge of predictably sharing the cache is further exacerbated.In this paper, we propose a cache aware partitioning strategy for limited-preemptive real-time tasks. We use the concept of feasibility windows that are specified by a period, relative offset and deadline, and a processor core, to ensure the behavior of the schedule that minimizes cache effects, as well as achieve efficient partitioning. Optimization is used to derive the feasibility windows for non-preemptive regions of the tasks. The feasibility windows can be instantiated to the context of table driven, earliest deadline first or fixed priority based schedulers.

Bibtex

@inproceedings{Thekkilakattil3689,
author = {Abhilash Thekkilakattil and Radu Dobrin and Sasikumar Punnekkat},
title = {Towards Exploiting Limited Preemptive Scheduling for Partitioned Multicore Systems},
month = {October},
year = {2014},
booktitle = {The 8th Junior Researcher Workshop on Real-Time Computing },
url = {http://www.es.mdu.se/publications/3689-}
}