G. Buttazzo, and John A. Stankovic, \RED: Robust Earliest Deadline scheduling," in Proc. 3rd Intl. Workshop on Responsive Computing Systems, pp. 100-111, Sep. 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....scheduled by the RTOS (real time operating system) A real time task set is # 0 , # n 1 where # i = T i , C i , D i , J i ) The elements of a task tuple respectively represent the period, worst case execution time, deadline, and maximum release jitter. Jitter, as defined by Tindell [24, 4], occurs when the worst case time between successive releases of a task is shorter than the worst case time between arrivals of a task. When there is no danger of ambiguity we write i rather than . A schedule for is a set of priority and preemption threshold assignments P = P 0 , ....

....eventually produce a correct result can be divided into those that change the task model from the developer s point of view and those that do not. A number of scheduling techniques for dealing with timing faults have been proposed that change the task model, including robust earliest deadline [4], time redundancy [6] rate adaptation [5] user defined timing failure 9 handlers [23] and (m, k) firm deadlines [13] Our method for increasing robustness does not change the task model. It is complementary to, and can be used independently of or in combination with, essentially all of the ....

Giorgio Buttazzo and John A. Stankovic. RED: Robust earliest deadline scheduling. In Proc. of the 3rd International Workshop on Responsive Computing Systems, pages 100--111, Lincoln, NH, September 1993.

....results that wcrc obtained by the simulation of 2 systems in order to compare their performance. 5. 1 Simulated systems The first simulated system ( EDF ) is made of tasks scheduled according to the earliest deadline first (EDF) policy, on top of an acceptance test similar to the one described in [5], based on the evaluation of the residual times of the tasks. A WCET for all the tasks is expected to be known. The implementation of this system directly uses the basic task model and attribute data structures of ARTISST. The second simulated system ( TPS ) is inspired from the taskpair ....

G. Buttazzo and J. Stankovic. Red: Robust earliest deadline scheduling. In Proceedings of the International Workshop on Responsive Computing Systems, 1993.

....tion 2) Default schedulers available. Currently, ARTISST comes with four default schedulers: a static priority scheduler, and three dynamic on line schedulers: the Earliest Deadline First scheduler [8] EDF) EDF with an acceptance test based on the evaluation of the residual times of the tasks [2] (GED) and TaskPair Scheduling [14] TPS) TPS achieves on line guarantees for the tasks, together with an exception handling mechanism. Actually, in TPS, the scheduler handles taskpairs, not directly tasks. A taskpair is composed of two tasks: the main task (MT) and the exception task (ET) The ....

G. Buttazzo and J. Stankovic. Red: Robust earliest deadline scheduling. In Proceedings of the International Workshop on Responsive Computing Systems, 1993.

No context found.

G. Buttazzo, and John A. Stankovic, \RED: Robust Earliest Deadline scheduling," in Proc. 3rd Intl. Workshop on Responsive Computing Systems, pp. 100-111, Sep. 1993.

No context found.

Giorgio C. Buttazzo and J. A. Stankovic, "RED: Robust earliest deadline scheduling," Tech. Rep. UM--CS-- 1993.

No context found.

G. Buttazzo and J. Stankovic, "RED: Robust Earliest Deadline Scheduling," IEEE???

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC