Title :
Non-preemptive Scheduling with History-Dependent Execution Time
Author :
Andersson, Björn ; Chaki, Sagar ; De Niz, Dionisio ; Dougherty, Brian ; Kegley, Russell ; White, Jules
Abstract :
Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.
Keywords :
scheduling; arbitrary-deadline sporadic tasks; exact schedulability analysis; history-dependent execution time; job schedule; nonpreemptive fixed-priority scheduling; Computational modeling; History; Optimization; Processor scheduling; Schedules; Time factors; Upper bound;
Conference_Titel :
Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on
Conference_Location :
Pisa
Print_ISBN :
978-1-4673-2032-0
DOI :
10.1109/ECRTS.2012.38
