Non-Preemptive Fixed-Priority Uniprocessor Scheduling where the
Execution Time of a Job Depends on the Scheduling of Jobs that
Executed Before it
Björn
Andersson, Dionisio de Niz, Sagar Chaki,
Proceedings of the 2nd International Real-Time Scheduling
Open Problems Seminar (RTSOPS'11), pages 9-10, July 5, 2011
Abstract:
We consider non-preemptive fixed-priority scheduling of a set of
constrained-deadline sporadic tasks on a single processor. We assume
that the execution time of a job J depends on the sequence of jobs
executed before J, that is, the execution time of a job of a task is
not a constant. We raise the following two open problems (i) given a
priority assignment, can the response time of a task be computed in
pseudo-polynomial time? and (ii) how to create an optimal
priority-assignment scheme?
PDF/
Online