
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Vestal, "FixedPriority Sensitivity Analysis for Linear Compute Time Models," IEEE Transactions on Software Engineering, vol. 20, no. 4, pp. 308317, April, 1994.  
BibTex  x  
@article{ 10.1109/32.277577, author = {S. Vestal}, title = {FixedPriority Sensitivity Analysis for Linear Compute Time Models}, journal ={IEEE Transactions on Software Engineering}, volume = {20}, number = {4}, issn = {00985589}, year = {1994}, pages = {308317}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.277577}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  FixedPriority Sensitivity Analysis for Linear Compute Time Models IS  4 SN  00985589 SP308 EP317 EPD  308317 A1  S. Vestal, PY  1994 KW  sensitivity analysis; scheduling; computational complexity; realtime systems; formal verification; fixedpriority sensitivity analysis; linear computation time models; scheduling discipline; hard realtime periodic tasks; task scheduling feasibility; fixedpriority preemptive scheduling; uniprocessor; software components; task decomposition; modules; realtime scheduling; rate monotonic scheduling; schedulability analysis; realtime verification; software development process; realtime benchmarking; realtime architectures VL  20 JA  IEEE Transactions on Software Engineering ER   
Several formal results exist that allow an analytic determination of whether a particular scheduling discipline can feasibly schedule a given set of hard realtime 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 fixedpriority preemptive scheduling of hard realtime 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. RealTime Syst. Symp.., 1993, pp. 194200.
[2] M.W. Borger, M.H. Klein, and R.A. Veltre, "Realtime software engineering in Aria: Observations and guidelines," Tech. Rep. CMU/SEI89TR22, Software Eng. Inst., Pittsburgh, PA, 1989.
[3] R. Clapp et al., "Toward RealTime Performance Benchmarks for Ada,"Comm. ACM, Vol. 29, No. 8, Aug. 1986, pp. 760778.
[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. 271280, 1979.
[5] U.S. Department of Defense, "Reference manual for the Ada programming language," ANSI/MILSTD1815A, 1983.
[6] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. 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: SpringerVerlag, 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. 116128.
[10] M. Klein et al.,A Practitioner's Handbook for RealTime Analysis: Guide to RateMonotonic Analysis for RealTime Systems, Kluwer Academic Publishers, Boston, July, 1993.
[11] J. P. Lehoczky, L. Sha, and Y. Ding, "The rate monotonic scheduling algorithmExact characterization and average case behavior," inProc. IEEE RealTime Syst. Symp., 1989.
[12] J.P. Lehoczky, "Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,"Proc. 11th RealTime Systems Symp., IEEE CS Press, Los Alamitos, Calif., Order No. 2112, 1990, pp. 201212.
[13] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard realtime environment,"J. ACM, vol. 20, no. 1, pp. 4661, Jan. 1973.
[14] V. Nirkhe and W. Pugh, "A partial evaluator for the Maruti hard realtime system,"Proc. 12th RealTime Syst. Symp., 1991, pp. 6473.
[15] C.Y. Park and A.C. Shaw, "A sourcelevel tool for predicting deterministic execution times of programs," Tech. Rep. 890912, Dept. of Comput. Sci. and Eng. FR35, Univ. of Wash., Seattle, 1989.
[16] SEI, "Rate monotonic scheduling theory: Practical applications, TriAda 90," tutorial notes, Software Eng. Inst., Pittsburgh, PA, 1990.
[17] L. Sha and J. B. Goodenough, "Realtime scheduling theory and Ada,"IEEE Comput., vol. 23, pp. 5362, Apr. 1990.
[18] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to realtime 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 realtime Euclid,"Proc. 8th RealTime Syst. Symp., 1987, pp. 218227.
[20] H. Tokuda and M. Kotera, "Scheduler 123: An interactive schedulability analyzer for realtime systems,"Proc. IEEE Compsac '88, 1988, pp. 211219.
[21] S. Vestal, "'On the accuracy of predicting rate montonic scheduling performance,"TriAda 90, 1990, pp. 244253.
[22] S. Vestal, "Linear benchmarks,"Ada Lett., Nov./Dec. 1990, pp. 145156.
[23] S. Vestal, "Modelbased templates for realtime scheduling," inIEEE Int. Conf. Syst. Eng., 1991, pp. 135138.