Scheduling Algorithms and Operating Systems Support for Real-Time Systems

Proceedings of the IEEE

Volumn 82, Issue 1, 1994, Pages 55-67

  Ramamritham, Krithi ^a   Stankovic, John A ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER OPERATING PROCEDURES; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; CONSTRAINT THEORY; FAULT TOLERANT COMPUTER SYSTEMS; OPERATIONS RESEARCH; RANDOM PROCESSES; SCHEDULING; STORAGE ALLOCATION (COMPUTER); TIME SHARING SYSTEMS;

DYNAMIC BEST EFFORT SCHEDULING; DYNAMIC PLANNING BASED SCHEDULING; REAL TIME COMPUTING; RESEARCH KERNELS; RESOURCE RECLAIMING; SCHEDULING ALGORITHMS; STATIC PRIORITY PREEMPTIVE SCHEDULING; STATIC TABLE DRIVEN SCHEDULING; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 0028320392     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.259426     Document Type: Article

References (76)

1. L. Alger and J. Lala, “real time operating system for a nuclear power plant computer,” in Proc. Real Time Systems Symp., Dec. 1986.
2. T. Baker, “Stack-based scheduling of real time processes,” Real Time Syst. vol. 3, no. 1, 67–100, March 1991.
3. J. A. Bannister and K. S. Trivedi, “Task allocation in fault-tolerant tolerant distributed systems,” Acta Informatica, pp. 261–281, 1983.
4. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang, “On the competitiveness of on-line real time scheduling,” in Proc Real Time Systems Symp., Dec. 1991.
5. S. Biyabani, J. A. Stankovic, and K. Ramamritham, “The integration of deadline and criticalness in hard real time scheduling,” in Proc. Real Time Systems Symp., Dec. 1988.
6. B. A. Blake and K. Schwan, “Experimental evaluation of a real time scheduler for a multiprocessor system,” IEEE Trans. Software Eng., vol. 17, no. 1, Jan. 1991
7. J. Blazewicz, W. Cellary, R. Slowinski, and J. Weglarz, “Scheduling under resource constraints-deterministic models,” in Annals of Operations Research. Baltzer AG Scientific Pub. Company, 1986.
8. G. D. Carlow, “Architecture of the Space Shuttle primary avionics software system,” Commun. ACM, vol. 27, no. 9, Sept. 1984.
9. H. Chetto and M. Chetto, “Some results of the earliest deadline scheduling algorithm,” IEEE Trans. Software Eng., vol. 15, no. 10, Oct. 1989.
10. Chorus Kernel v3 r4.0 Programmer's Reference Manual, Tech. CS/TR-91-71, Chorus 1991.
11. W. Chu and L. Lan, “Task allocation and precedence relations for distributed real time systems,” IEEE Trans. Comput., vol. C-36, no. 6, June 1987.
12. E. G. Coffman, Ed., Computer and Job/Shop Scheduling Theory. New York: Wiley, 1976.
13. A. Damm, J. Reisinger, W. Schnakel, and H. Kopetz, “The real time operating system of Mars,” Operating Syst. Rev., pp. 141–157, July 1989.
14. S. Davari and S. K. Dhall, “An on line algorithm for real time tasks allocation,” in Proc. Real Time Systems Symp. Washington, DC: Computer Soc. Press, Dec. 1986.
15. M. L. Dertouzos and A. K. L. Mok, “Multiprocessor on-line scheduling of hard-real time tasks,” IEEE Trans. Software Eng., vol. 15, no. 12, Dec. 1989.
16. B. Furht, D. Grostick, D. Gluch, G. Rabbat, J. Parker, and M. Roberts. Real Time Unix Systems. Norwell, MA: Kluwer, 1991.
17. M. R. Garey and D. S. Johnson, “Complexity results for multiprocessor scheduling under resource constraints,” SIAM J. vol. 4, 1975.
18. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
19. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM J. Appl. Math., vol. 17, no. 2, Mar. 1969.
20. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: A survey,” Annals Discrete Math., vol. 5, 1979.
21. O. Gudmundsson, D. Mose, K. Ko, A. Agrawala, and S. Tripathi, “MARUTI, An environment for hard real time applications,” in Mission Critical Operating Systems, A. Agrawala, K. Gordon, and P. Hwang, Eds. IOS Press, 1992.
22. V. P. Holmes, D. Harris, K. Piorkowski, and G. Davidson,” “Hawk: An operating system kernel for a real time embedded Sandia Nat. Labs., Rep., 1987.
23. K. S. Hong and J.Y.T. Leung, “On-line scheduling of real time tasks,” in Proc. Real Time Systems Symp., Dec. 1988.
24. C-J. Hou and K. G. Shin, “Load sharing with considerations of future arrivals in heterogeneous distributed real time systems,” in Proc. Real Time Systems Symp., Dec. 1991, pp. 94–103.
25. D. Jensen, “The kernel computational model of the alpha real time distributed operating system,” in Mission Critical Operating Systems, A. Agrawala, K. Gordon, and P. Hwang, Eds. IOS Press, 1992.
26. D. Kandlur, D. Kiskis, and K. Shin, “A real time operating system for HARTS,” in Mission Critical Operating Systems, A. Agrawala, K. Gordon, and P. Hwang, Eds. IOS Press, 1992.
27. H. Kopetz, A. Demm, C. Koza, and M. Mulozzani, “Distributed fault tolerant real time systems: The Mars approach,” IEEE Micro, pp. 25–40, 1989.
28. C. M. Krishna and K. G. Shin, “On scheduling tasks with a quick recovery from failure,” IEEE Trans. Comput., vol. C-35, no. 5, pp. 448–55, May 1986.
29. E. Lawler, “Recent results in the theory of machine scheduling,” Mathematical Programming: The State of the Art, A. Bachem et al., Eds. New York: Springer-Verlag, 1983.
30. E. L. Lawler and C. U. Martel, “Scheduling periodically occurring tasks on multiple processors,” Information Processing Lett., vol. 12, no. 1, Feb. 1981.
31. J. P. Lehoczky, L. Sha, and J. Strosnider, “Enhancing aperiodic responsiveness in a hard real time environment,” in Proc. Real Time Time Systems Symp., 1987.
32. J. P. Lehoczky, L. Sha, and Y. Ding, “The rate monotone scheduling algorithm: exact characterization and average case behavior,” in Proc. IEEE Real Time Systems Symp., Dec. 1989, pp. 166–171.
33. D. W. Leinbaugh, “Guaranteed response time in a hard real time time environment,” IEEE Trans. Software Eng., vol. SE-6, Jan. 1980.
34. J. K Lenstra, A. H. G. R. Kan, and P. Bruchker, “Complexity of machine scheduling problems,” in Annals of Discrete Mathematics. New York: North-Holland, 1977.
35. A. L. Liestman and R. H. Campbell, “A fault tolerant scheduling problem,” IEEE Trans. Software Eng., vol. SE-12, no. 11, pp. 1089–1095, Nov. 1986.
36. C. L. Liu and J. Layland, “Scheduling algorithms for multiprogramming in a hard real time environment,” J. Amer. Compt. Mach., vol. 20, no. 1, pp. 46–61, 1973.
37. J. W. S. Liu, K. Lin, W. Shih, A. Yu, J. Chung, and W. Zhao, “Algorithms for scheduling imprecise calculations,” IEEE Comput., vol. 24, no. 5, pp. 58–68, May 1991.
38. J. W. S. Liu et al., “Imprecise computations,” this issue, pp. 00–00.
39. C. D. Locke, “Best-effort decision making for real time scheduling,” Ph.D. dissertation, Carnegie Mellon Univ., Pittsburgh, PA, May 1985.
40. “Software architecture for hard real time applications: Cyclic executives vs. fixed priority executives,” in Real Time Systems, vol. 4, no.1. Norwell, MA: Kluwer, Mar. 1992.
41. G. K. Manacher, “Production and stabilization of real time task schedules,” J. Assoc. Ccomput. Mach., vol. 14, no. 3, 1967.
42. A. K. Mok, “Fundamental design problems of distributed systems for the hard real time environment, Ph.D. dissertation, Dep. Elec. Engi. Comput. Sci., Mass. Inst. Technol., Cambridge, MA, May 1983.
43. D. T. Peng and K. G. Shin, “Static allocation of periodic tasks with precedence constraints in distributed real time systems,” in Proc. Int. Conf. on Distributed Computing, June 1989, pp. 190–198.
44. R. Rajkumar, L. Sha, and J. Lehoczky, “ real time synchronization protocols for multiprocessors,” in Proc. Real Time Systems Symp., 1988.
45. R. Rajkumar, L. Sha, J. P. Lehoczky, and K. Ramamritham, in Principles of Real Time Systems, S. Son, Ed. (to appear), 1994.
46. K. Ramamritham and J. A. Stankovic, “Dynamic task scheduling in distributed hard real time systems,” IEEE Software, vol. 1, no. 3, pp. 65–75, July 1984.
47. K. Ramamritham, “Allocation and scheduling of complex periodic tasks,” in 10th Int. Conf. on Distributed Computing Systems (Paris, France, June 1990).
48. K. Ramamritham and J. A. Stankovic, “Scheduling strategies adopted in Spring: An overview,” in Foundations of Real Time Time Computing: Scheduling and Resource Management, A. van Tilborg and G. Koob, Eds.
49. K. Ramamritham, J. A. Stankovic, and P. Shiah, “Efficient scheduling algorithms for real time multiprocessor systems,” IEEE Trans. Parallel Distributed Syst., vol. 1, no. 2, pp. 184–94, Apr. 1990.
50. K. Ramamritham, J. A. Stankovic, and W. Zhao, “Distributed scheduling of tasks with deadlines and resource requirements,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1110–1123, Aug. 1989.
51. K. Ramamritham, G. Fohler, and J. M. Adan, “Issues in the static allocation and scheduling of complex periodic tasks,” in 10th IEEE Workshop on Real Time Operating Systems and Software, May 1993.
52. J. Ready, “VRTX: A real time operating system for embedded microprocessor applications,” IEEE Micro, pp. 8–17, Aug. 1986.
53. K. Schwan, A. Geith, and H. Zhou, “From Chaosbase to Chaos arc : A family of real time kernels,” in Proc. Real Time Systems Symp., Dec. 1990, pp. 82–91.
54. L. Sha, R. Rajkumar, and J. Lehoczky, “Priority inheritance protocols: An approach to real time synchronization, IEEE Trans. Comput., vol. 39, no. 3, pp. 1175–1185, 1990.
55. L. Sha, R. Rajkumar, J. Lehoczky, and K. Ramamritham, “Mode change protocols for priority-driven preemptive scheduling,” Real Time Syst., vol. 1, no. 3, pp. 243–264, Dec. 1989.
56. L. Sha et al., “Generalized rate-monotonic scheduling theory: A framework for developing real time systems,”, this issue, pp. 00–00.
57. C. Shen, K. Ramamritham, and J. A. Stankovic, “Resource reclaiming in multiprocessor real time systems,” IEEE Trans. Parallel Distributed Syst., vol. 4, no. 4, pp. 382–397, Apr. 1993.
58. B. Sprunt, L. Sha, and J. Lehoczky, “ Aperiodic task scheduling for hard real time systems,” Real Time Syst., vol. 1, no. 1, pp. 27–60, 1989.
59. J. A. Stankovic, “ stability and distributed scheduling algorithms,” IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1141–1152, 1985.
60. J. A. Stankovic, “Decentralized decision making for task allocation in a hard real time system,” IEEE Trans. Comput., Mar. 1989.
61. “Misconceptions about real time computing,” IEEE Comput., put., vol. 21, no. 10, Oct. 1988.
62. J. A. Stankovic and K. Ramamritham, “The Spring kernel: A new paradigm for real time operating systems,” ACM Operating Syst. Rev., vol. 23, no. 3, pp. 54–71, July 1989.
63. “The Spring kernel: A new paradigm for hard real time operating systems,” IEEE Software, vol. 8, no. 3, pp. 62–72, May 1991.
64. J. A. Stankovic, K. Ramamritham, and S. Cheng, “Evaluation of a flexible task scheduling algorithm for distributed hard real time time systems,” IEEE Trans. Comput., vol. C-34, no. 12, pp. 1130–1143, 1985.
65. J. A. Stankovic, “SpringNet: A scalable architecture for high performance, predictable, distributed, real time computing,” Univ. of Massachusetts, Tech. Rep. 91–74, Oct. 1991.
66. J. A. Stankovic, F. Wang, and K. Ramamritham, “Dynamic scheduling to support adaptive fault tolerance in real time systems,” submitted for publication, Dec. 1992.
67. SYSTRAN Corp., Scramnet Network Reference Manual, Dayton, OH, 45432.
68. H. Tokuda, and C. Mercer, “ARTS: A distributed real time kernel,” ACM Operating Systems Rev., vol. 23, no. 3, July 1989.
69. H. Tokuda, T. Nakajima, and P. Rao, “real time Mach: Towards a predictable real time system,” in Proc. Usenix Mach Workshop, Oct. 1990.
70. H. Tokuda, J. Wendorf, and H. Wang, “Implementation of a time driven scheduler for real time operating systems,” in Proc. Real Time Time Systems Symp. Washington, DC: Computer Soc. Press, Dec. 1987.
71. R. van Scoy, J. Bamberger, and R. Firth, “An overview of DARK,” in Mission Critical Operating Systems, A. Agrawala, K. Gordon, and P. Hwang, Eds. IOS Press, 1992.
72. F. Wang, K. Ramamritham, and J. A. Stankovic, “Bounds on the schedule length for some heuristic scheduling algorithms for hard real time systems,” in Proc. Real Time Systems Symp., 1992.
73. J. Xu and L. Parnas, “Scheduling processes with release times, deadlines, precedence, and exclusion relations,” IEEE Trans. Software Eng., 360–369, Mar. 1990.
74. W. Zhao and K. Ramamritham, “ Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints,” J. Syst. Software, vol. 7, 195–205, 1987.
75. W. Zhao, K. Ramamritham, and J. A. Stankovic, “Scheduling tasks with resource requirements in hard real time systems,” IEEE Trans. Software Eng., vol. SE-12, no. 5, pp. 567–577, 1987.
76. “Preemptive scheduling under time and resource constraints,” IEEE Trans. Comput., vol. C-36, no. 8, pp. 949–960, Aug. 1987.