We consider the problem of on-line scheduling of a set of hard real-time tasks in an environment where future task parameters are not known a-priori. First, we derive necessary and sufficient conditions to determine whether a given set of tasks with known parameters is feasible using a set of m processors. Next, we consider two sets of tasks T/sub 0/ and T/sub t/ where T/sub 0/ is the set of tasks that need to be scheduled at time 0 such that any future task set T/sub t/, t>0 can be scheduled with or without disturbing the schedule for T/sub 0/. In this context, we derive necessary and sufficient conditions applicable to the schedule obtained for T/sub 0/ at time 0 such that, any future task set T/sub t/ can be scheduled provided the task set T/sub 0//spl cup/T/sub t/ is feasible using m processors.
[1]
Michael L. Dertouzos,et al.
Control Robotics: The Procedural Control of Physical Processes
,
1974,
IFIP Congress.
[2]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[3]
Aloysius K. Mok,et al.
Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks
,
1989,
IEEE Trans. Software Eng..
[4]
Maryline Chetto,et al.
Some Results of the Earliest Deadline Scheduling Algorithm
,
1989,
IEEE Transactions on Software Engineering.
[5]
Joseph Y.-T. Leung,et al.
On-Line Scheduling of Real-Time Tasks
,
1992,
IEEE Trans. Computers.