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

Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform

Authors:

Leo Hatvani, Reinder J. Bril

Publication Type:

Conference/Workshop Paper

Venue:

20th IEEE International Conference on Emerging Technologies and Factory Automation

Abstract

To combine the relative strengths of fully preemptive and non-preemptive fixed priority scheduling, we can use limited preemptive scheduling methods. One such method is fixed-priority threshold scheduling (FPTS). This approach defines dual priorities for every task, a priority assigned to the inactive jobs and an equal or a higher one, called preemption threshold, for the jobs that have already started executing. A task can preempt another task's job if and only if its priority is greater than the other task's preemption threshold. FPTS can be implemented by assigning tasks to non-preemptive groups in a one-to-many manner. That is groups of tasks that are mutually non-preemptive.

Bibtex

@inproceedings{Hatvani5884,
author = {Leo Hatvani and Reinder J. Bril},
title = {Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform},
pages = {1--8},
month = {September},
year = {2015},
booktitle = {20th IEEE International Conference on Emerging Technologies and Factory Automation},
url = {http://www.es.mdu.se/publications/5884-}
}