Non-Preemptive Scheduling with History-Dependent Execution Time
Bjorn Andersson, Sagar Chaki, Dionisio de Niz, Brian Dougherty, Russell Kegley, Jules White, Proceedings of the 24th Euromicro Conference on Real-Time Systems (ECRTS), page 363-372, July 11 -- 13, 2012.
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.