This Article 
 Bibliographic References 
 Add to: 
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models
April 1994 (vol. 20 no. 4)
pp. 308-317

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.

[1] P. Binns and S. Vestal, "Scheduling and communication in MetaH,"Proc. Real-Time Syst. Symp.., 1993, pp. 194-200.
[2] M.W. Borger, M.H. Klein, and R.A. Veltre, "Real-time software engineering in Aria: Observations and guidelines," Tech. Rep. CMU/SEI-89-TR-22, Software Eng. Inst., Pittsburgh, PA, 1989.
[3] R. Clapp et al., "Toward Real-Time Performance Benchmarks for Ada,"Comm. ACM, Vol. 29, No. 8, Aug. 1986, pp. 760-778.
[4] R. A. DeMillo, R. J. Lipton, and A. J. Perlis, "Social processes and proofs of theorems and programs,"Commun. ACM, vol. 22, no. 5, pp. 271-280, 1979.
[5] U.S. Department of Defense, "Reference manual for the Ada programming language," ANSI/MIL-STD-1815A, 1983.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[7] [7] J.B. Goodenough and L. Sha, "The priority ceili
[8] D. Gries,The Science of Programming. New York: Springer-Verlag, 1981.
[9] M. Gonzalez Härbour, M. H. Klein, J. P. Lehoczley, "Fixed priority scheduling of periodic tasks with varying execution priority,"Proc. IEEE Real. Time Syst. Symp., Los Alamitos, CA: IEEE Press, 1991, pp. 116-128.
[10] M. Klein et al.,A Practitioner's Handbook for Real-Time Analysis: Guide to Rate-Monotonic Analysis for Real-Time Systems, Kluwer Academic Publishers, Boston, July, 1993.
[11] J. P. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithm--Exact characterization and average case behavior," inProc. IEEE Real-Time Syst. Symp., 1989.
[12] J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,"Proc. 11th Real-Time Systems Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 2112, 1990, pp. 201-212.
[13] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[14] V. Nirkhe and W. Pugh, "A partial evaluator for the Maruti hard real-time system,"Proc. 12th Real-Time Syst. Symp., 1991, pp. 64-73.
[15] C.Y. Park and A.C. Shaw, "A source-level tool for predicting deterministic execution times of programs," Tech. Rep. 89-09-12, Dept. of Comput. Sci. and Eng. FR-35, Univ. of Wash., Seattle, 1989.
[16] SEI, "Rate monotonic scheduling theory: Practical applications, Tri-Ada 90," tutorial notes, Software Eng. Inst., Pittsburgh, PA, 1990.
[17] L. Sha and J. B. Goodenough, "Real-time scheduling theory and Ada,"IEEE Comput., vol. 23, pp. 53-62, Apr. 1990.
[18] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization," Tech. Rep., Depts. of Comput. Sci., Elec. and Comput. Eng., and Statistics, Carnegie Mellon Univ., Pittsburgh, PA, 1987.
[19] A.D. Stoyenko, "A schedulability analyzer for real-time Euclid,"Proc. 8th Real-Time Syst. Symp., 1987, pp. 218-227.
[20] H. Tokuda and M. Kotera, "Scheduler 1-2-3: An interactive schedulability analyzer for real-time systems,"Proc. IEEE Compsac '88, 1988, pp. 211-219.
[21] S. Vestal, "'On the accuracy of predicting rate montonic scheduling performance,"Tri-Ada 90, 1990, pp. 244-253.
[22] S. Vestal, "Linear benchmarks,"Ada Lett., Nov./Dec. 1990, pp. 145-156.
[23] S. Vestal, "Model-based templates for real-time scheduling," inIEEE Int. Conf. Syst. Eng., 1991, pp. 135-138.

Index Terms:
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," IEEE Transactions on Software Engineering, vol. 20, no. 4, pp. 308-317, April 1994, doi:10.1109/32.277577
Usage of this product signifies your acceptance of the Terms of Use.