
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J. Xu, D.L. Parnas, "On Satisfying Timing Constraints in HardRealTime Systems," IEEE Transactions on Software Engineering, vol. 19, no. 1, pp. 7084, January, 1993.  
BibTex  x  
@article{ 10.1109/32.210308, author = {J. Xu and D.L. Parnas}, title = {On Satisfying Timing Constraints in HardRealTime Systems}, journal ={IEEE Transactions on Software Engineering}, volume = {19}, number = {1}, issn = {00985589}, year = {1993}, pages = {7084}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.210308}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  On Satisfying Timing Constraints in HardRealTime Systems IS  1 SN  00985589 SP70 EP84 EPD  7084 A1  J. Xu, A1  D.L. Parnas, PY  1993 KW  timing constraints; hardrealtime systems; preruntime scheduling; mathematical scheduling problems; operating systems (computers); realtime systems; scheduling VL  19 JA  IEEE Transactions on Software Engineering ER   
The authors explain why preruntime scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hardrealtime system. They examine some of the major concerns in preruntime scheduling and consider what formulations of mathematical scheduling problems can be used to address those concerns. This work provides a guide to the available algorithms.
[1] T. P. Baker and A. Shaw, "The cyclic executive model and Ada,"J. RealTime Syst., vol. 1, pp. 1725, June 1989.
[2] K. R. Baker and Z.S. Su, "Sequencing with duedates and early start times to minimize maximum tardiness,"Nav. Res. Log. Quart., vol. 21, pp. 171176, Mar. 1974.
[3] G. Belpaire and J.P. Wilmotte, "A semantic approach to the theory of parallel processes," inProc. 1973 European ACM Symp., Davos, Switzerland, 1973, pp. 217222.
[4] J. Blazewicz, "Scheduling dependent tasks with different arrival times to meet deadlines," inModeling and Performance Evaluation of Computer Systems. Amsterdam: NorthHolland, 1976.
[5] J. Blazewicz, "Deadline scheduling of tasks with ready times and resource constraints,"Inform. Proc. Lett., vol. 8, pp. 6063, Feb. 1979.
[6] J. Blazewicz, M. Drabowski, and J. Weglarz, "Scheduling multiprocessor tasks to minimize schedule length,"IEEE Trans. Comput., vol. C35, pp. 389393, May 1986.
[7] P. Bratley, M. Florian, and P. Robillard, "Scheduling with earliest start and due date constraints,"Nav. Res. Log. Quart., vol. 18, pp. 511519, Dec. 1971.
[8] P. Bratley, M. Florian, and P. Robillard, "Scheduling with earliest start and due date constraints on multiple machines,"Nav. Res. Log. Quart., vol. 22, pp. 165173, 1975.
[9] J. Carlier, "Probleme a une machine," Manuscript, Institute de Programmation, Universite Paris VI, 1980.
[10] G. D. Carlow, "Architecture of the space shuttle primary avionics software system,"Commun. ACM, vol. 27, no. 9, pp. 926936, Sept. 1984.
[11] J.Y. Chung, J. W. S. Liu, and K.J. Lin, "Scheduling periodic jobs that allow imprecise results,"IEEE Trans. Comp., vol. 19, pp. 11561173, Sept. 1990.
[12] E. G. Coffman, Jr.,Computer and Jobshop Scheduling Theory. New York: WileyInterscience, 1976.
[13] P. J. Courtois, F. Heymans, and D. L. Parnas, "Concurrent control with readers and writers,"Commun. ACM, vol. 14, no. 2, pp. 667 668, Oct. 1971.
[14] S. Davari and S. K. Dhall, "An online algorithm for realtime tasks allocation," inProc. IEEE RealTime Systems Symp., Dec. 1986.
[15] S. K. Dhall and C. L. Liu, "On a realtime scheduling problem,"Operations Res., vol. 26, pp. 127140, 1978.
[16] E. W. Dijkstra, "Cooperating sequential processes," inProgramming Languages, F. Genuys, Ed. London: Academic Press, 1968.
[17] E. W. Dijkstra, "Notes on structured programming," inStructured programming, O.J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, Eds. London: Academic Press, 1972.
[18] S. R. Faulk and D. L. Parnas, "On synchronization in hardrealtime systems,"Commun. ACMvol. 31, no. 3, Mar. 1988.
[19] M. R. Garey and D. S. Johnson, "Scheduling tasks with nonuniform deadlines on two processors,"J. ACM, vol. 23, no. 3, July 1976.
[20] M. R. Garey and D. S. Johnson, "Twoprocessor scheduling with start times and deadlines,"SIAM J. Comput., vol. 6, pp. 416426, Sept. 1977.
[21] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NPCompleteness. San Francisco, CA: Freeman, 1979.
[22] M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, "Scheduling unittime tasks with arbitrary release times and deadlines,"SIAM J. Comput., vol. 10, pp. 256269, May 1981.
[23] M. J. Gonzales, "Deterministic processor scheduling,"ACM Comput. Surveys, vol. 9, no. 3, Sept. 1977.
[24] T. Gonzales and S. Sahni, "preemptive scheduling of uniform processor systems,"J. ACM, vol. 25, pp. 92101, 1978.
[25] M. J. Gonzalez and J. W. Soh, "Periodic job scheduling in a distributed processor system,"IEEE Trans. Aerosp. Electron. Syst., vol. AES12, no. 5, pp. 530535, Sept. 1976.
[26] D. Gunsfield, "Bounds for naive multiple machine scheduling with release times and deadlines,"J. Algorithms, vol. 5, pp. 16, 1984.
[27] W. A. Horn, "Some simple scheduling problems,"Nav. Res. Log. Quart., vol. 21, pp. 177185, Mar. 1974.
[28] A. D. Stoyenko and E. Kligerman, "Realtime Euclid: a language for reliable realtime systems,"IEEE Trans. Software Eng., vol. SE12, pp. 940949, Sept. 1986.
[29] H. Kopetz, A. Damm, C. Koza, M. Mulazanni, W. Schwabl, C. Senft, and R. Zainlinger, "Distributed faulttolerant realtime systems: the Mars approach,"IEEE Micro, pp. 2540, Feb. 1989.
[30] E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Recent developments in deterministic sequencing and scheduling: a survey," inProc. NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems, Durham, England, July 1981, inDeterministic and Stochastic Scheduling, M. A. H. Dempsteret al., Eds. Dordrecht, The Netherlands: D. Reidal Publishing, 1992, pp. 3573.
[31] E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple processors,"Information Processing Lett., vol. 12, pp. 912, Feb. 1981.
[32] D. W. Leinbaugh, "Guaranteed response time in a hard realtime environment,"IEEE Trans. Software Eng., vol SE6, pp. 8591, Jan. 1980.
[33] J. Y.T. Leung and M. L. Merrill, "A note on preemptive scheduling of periodic, realtime tasks,"Inform. Process. Lett., vol. 11, pp. 115118, Nov. 1980.
[34] 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.
[35] C. Martel, "Preemptive scheduling with release times, deadlines, and due times,"J. ACM, vol. 29, no. 3, pp. 812829, July 1982.
[36] G. McMahon and M. Florian, "On scheduling with ready times and due dates to minimize maximum lateness,"Operations Res., vol. 23, pp. 475482, 1975.
[37] M. P. MelliarSmith and R. L. Schwartz, "Formal specification and mechanical verification of SIFT: A faulttolerant flight control system,"IEEE Trans. Comput., vol. C31, pp. 616629, July 1982.
[38] A. K. Mok and M. L. Detouzos, "Multiprocessor scheduling in a hard realtime environment," inProc. 7th IEEE Texas Conf. on Computing Systems, Nov. 1978.(Also inIEEE Trans. Software Eng., vol. 15, pp. 14971506, Dec. 1989.)
[39] A. K. Mok, "Fundamental design problems of distributed systems for the hardrealtime environment," Ph.D. dissertation, Dept. of Electrical Engineering and Computer Science, The Massachusetts Institute of Technology, Cambridge, MA, May 1983.
[40] A. K. Mok, "The design of realtime programming systems based on process models," inProc. IEEE RealTime Systems Symp., Dec. 1984, pp. 517.
[41] A. K. Moket al., "Evaluating tight execution time bounds of programs by annotations," inProc. 6th IEEE Workshop on RealTime Operating Systems and Software, May 1989, pp. 7480.
[42] C. Y. Park and A. C. Shaw, "Experiments with a program timing tool based on sourcelevel timing schema,"IEEE Computer, vol. 24, pp. 4857, May 1991.
[43] P. Puschner and C. Koza, "Calculating the Maximum Execution Time of RealTime Programs,"J. RealTime Systems, Vol. 1, No. 2, Sept. 1989, pp. 159176.
[44] S. Sahni and Y. Cho, "Nearly online scheduling of a uniform processor system with release times,"SIAM J. Comput., vol. 8, pp. 275285, 1979.
[45] S. Sahni and Y. Cho, "Scheduling independent tasks with due dates on a uniform processor system,"J. Ass. Comput. Mach., vol. 27, pp. 550563, July 1980.
[46] O. Serlin, "Scheduling of time critical processes," inProc. Spring Joint Computer Conf., vol. 40, 1972, pp. 925932.
[47] A. C. Shaw, "Reasoning about time in higherlevel language software,"IEEE Trans. Software Eng., vol. 15, pp. 875889, July 1989.
[48] C. D. Shepard and J. A. M. Gagné, "A model of the F18 mission computer software for preruntime scheduling," inProc. IEEE 10 Int. Conf. Distri. Comp. Syst., Paris, France, May 1990.
[49] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: an approach to realtime synchronization,"IEEE Trans. Comput., vol. 39, pp. 11751185, Sept. 1990.
[50] B. Simons, "Multiprocessor scheduling of unittime jobs with arbitrary release times and deadlines,"SIAM J. Comput., vol. 12, pp. 294299, May 1983.
[51] J.A. Stankovic, "RealTime Computing Systems: The Next Generation," inHard RealTime Systems, J.A. Stankovic and K. Ramamritham, eds., IEEE Computer Society Press, Los Alamitos, Calif., 1988, pp. 1437.
[52] J. Xu and D. L. Parnas, "Scheduling processes with release times, deadlines, precedence, and exclusion relations,"IEEE Trans. Software Eng., pp. 360369, Mar. 1990.
[53] J. Xu, "Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations," to appear inIEEE Trans. Software Eng., vol. 19, no. 2, Feb. 1992.
[54] J. Xu and D. L. Parnas, "Preruntime scheduling of processes with exclusion relations on nested or overlapping critical sections," inProc. 11th Annu. IEEE Int. Phoenix Conf. on Computers and Communications (IPCCC92), Scottsdale, AZ, April 13, 1992, pp. 774782.
[55] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.
[56] W. Zhao, K. Ramamritham, and J. Stankovic, "Scheduling tasks with resource requirements in hard realtime systems,"IEEE Trans. Software Eng., vol. SE13, pp. 564577, May 1987.
[57] W. Zhao, J. Stankovic, and K. Ramamrithan, "A window protocol for transmission of time constrained messages,"IEEE Trans. Comput., vol. 39, pp. 11861203, Sept. 1990.