DocumentCode
3674071
Title
Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform
Author
Leo Hatvani;Reinder J. Bril
Author_Institution
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (TU/e), The Netherlands
fYear
2015
Firstpage
1
Lastpage
8
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.
Keywords
"Job shop scheduling","Time factors","Processor scheduling","Standards","Mathematical model","Operating systems","Algorithm design and analysis"
Publisher
ieee
Conference_Titel
Emerging Technologies & Factory Automation (ETFA), 2015 IEEE 20th Conference on
Type
conf
DOI
10.1109/ETFA.2015.7301449
Filename
7301449
Link To Document