The Community for Technology Leaders
Green Image
<p>Several formal results exist that allow an analytic determination of whether a particular scheduling discipline can feasibly schedule a given set of hard real-time periodic tasks. In most cases, these results provide little more than a 'yes' or 'no' answer. In practice, it is also useful to know how sensitive scheduling feasibility is to changes in the characteristics of the task set. This paper presents algorithms that allow a system developer to determine, for fixed-priority preemptive scheduling of hard real-time periodic tasks on a uniprocessor, how sensitive schedule feasibility is to changes in the computation times of various software components. The algorithms allow a system developer to determine what changes in task computation times can be made while preserving schedule feasibility (or what changes are needed to achieve feasibility). Both changes to the computation time of a single task and changes to the computation times of a specified subset of the tasks are analyzable. The algorithms also allow a decomposition of tasks into modules, where a module may be a component of multiple tasks.</p>
sensitivity analysis; scheduling; computational complexity; real-time systems; formal verification; fixed-priority sensitivity analysis; linear computation time models; scheduling discipline; hard real-time periodic tasks; task scheduling feasibility; fixed-priority preemptive scheduling; uniprocessor; software components; task decomposition; modules; real-time scheduling; rate monotonic scheduling; schedulability analysis; real-time verification; software development process; real-time benchmarking; real-time architectures

S. Vestal, "Fixed-Priority Sensitivity Analysis for Linear Compute Time Models," in IEEE Transactions on Software Engineering, vol. 20, no. , pp. 308-317, 1994.
92 ms
(Ver 3.3 (11022016))