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

A Comparison of Partitioning Strategies for Fixed Points-based Limited Preemptive Scheduling

Publication Type:

Journal article

Venue:

IEEE Transactions on Industrial Informatics

DOI:

10.1109/TII.2018.2848879


Abstract

The increasing industrial demand for handling complex functionalities has influenced the design of hardware architectures for time critical embedded systems, during the past decade. Multi-core systems facilitate the inclusion of many complex functionalities, while, at the same time, inducing cache related overheads, as well as adding partitioning complexity to the overall system schedulability. One of the efficient paradigms for controlling and reducing the cache related costs in real-time systems is Limited Preemptive Scheduling (LPS), with its particular instance Fixed Preemption Points Scheduling (LP- FPPS), that has been shown to be supported by and investigated in the automotive domain. With respect to the partitioning constraints, Partitioned Scheduling has been widely used to pre-runtime allocate tasks to specific cores, resulting in a predictable cache-related preemption delays estimations. In this paper we propose to integrate LP- FPPS and Partitioned Scheduling on fixed-priority multicore real-time systems in order to increase the overall system schedulability.

Bibtex

@article{Markovic5199,
author = {Filip Markovic and Jan Carlson and Radu Dobrin},
title = {A Comparison of Partitioning Strategies for Fixed Points-based Limited Preemptive Scheduling},
editor = {Ren C. Luo},
volume = {13},
number = {5},
pages = {1--12},
month = {June},
year = {2018},
journal = {IEEE Transactions on Industrial Informatics },
url = {http://www.es.mdh.se/publications/5199-}
}