Non-preemptive Scheduling with History-Dependent Execution Time
Bjorn A. Andersson, Sagar Chaki, Dionisio de Niz, Brian Dougherty, Russell B. Kegley, Jules White · 2012
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.