Scheduling for overload in real-time systems

IEEE Transactions on Computers

Volumn 46, Issue 9, 1997, Pages 1034-1039

  Baruah, Sanjoy K ^a,b   Haritsa, Jayant R ^a,c  

^a IEEE   (United States)

^b University of Vermont   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Overload tolerance; Performance evaluation; Processor utilization; Real time systems; Uniprocessor scheduling

Indexed keywords

ALGORITHMS; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

OVERLOAD TOLERANCE;

REAL TIME SYSTEMS;

EID: 0031389397     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.620484     Document Type: Article

References (17)

1. S. Baruah and J. Haritsa, "ROBUST: A Hardware Solution to Real-Time Overload," Proc. 13th ACM SIGMETRICS Conf., pp. 207-216, Santa Clara, Calif., May 1993.
2. S. Baruah, J. Haritsa, and N. Sharma, "On-Line Scheduling to Maximize Task Completions," Proc. 15th Real-Time Systems Symp., San Juan, Puerto Rico, Dec. 1994.
3. 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 Task Scheduling," Proc. 12th Real-Time Systems Symp., San Antonio, Tex., Dec. 1991.
4. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha, "On-Line Scheduling in the Presence of Overload," Proc. 32nd Ann. IEEE Symp. Foundations of Computer Science, San Juan, Puerto Rico, Oct. 1991.
5. S. Biyabani, J. Stankovic, and K. Ramamritham, "The Integration of Deadline and Criticalness in Hard Real-Time Scheduling," Proc. Ninth Real-Time Systems Symp., Dec. 1988.
6. S. Cheng, J. Stankovic, and K. Ramamritham, "Scheduling Survey," Hard Real-Time Systems Tutorial, Dec. 1988.
7. M. Dertouzos, "Control Robotics: The Procedural Control of Physical Processors," Proc. IFIP Congress, pp. 807-813, 1974.
8. J. Dey, J. Kurose, D. Towsley, C. Krishna, and M. Girkar, "Efficient On-Line Processor Scheduling for a Class of IRIS Real-Time Tasks," Proc. 13th ACM SIGMETRICS Conf., pp. 217-228, Santa Clara, Calif., May 1993.
9. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979.
10. J. Haritsa, M. Carey, and M. Livny, "On Being Optimistic about Real-Time Constraints," Proc. 1990 ACM Principles of Database Systems Symp., Apr. 1990.
11. J. Haritsa, M. Carey, and M. Livny, "Earliest-Deadline Scheduling for Real-Time Database Systems," Proc. 12th IEEE Real-Time Systems Symp., San Antonio, Tex., Dec. 1991.
12. E. Jensen, M. Carey, and M. Livny, "A Time-Driven Scheduling Model for Real-Time Operating Systems," Proc. IEEE Real-Time Systems Symp., Dec. 1985.
13. over: An Optimal On-Line Scheduling Algorithm for Overloaded Real-Time Systems," Proc. 13th Real-Time Systems Symp., Phoenix, Ariz., Dec. 1992.
14. C. Liu and J. Layland, "Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment," J. ACM, Jan. 1973.
15. C. D. Locke, "Best-Effort Decision Making for Real-Time Scheduling," PhD thesis, Computer Science Dept., Carnegie Mellon Univ., 1986.
16. A. Mok, "Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment," PhD thesis, Laboratory for Computer Science, Massachusetts Inst. of Technology, May 1983.
17. J. Stankovic, M. Spuri, M. Di Natale, and G. Buttazzo, "Implications of Classical Scheduling Results for Real-Time Systems," Computer, June 1995.