Dover: An optimal on-line scheduling algorithm for overloaded real-time systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 1992, Pages 290-299

  Koren, Gilad ^a   Shasha, Dennis ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; EARLIEST DEADLINE FIRST; EARLIEST DEADLINE FIRST ALGORITHM; ON-LINE ALGORITHMS;

RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING ALGORITHMS;

REAL TIME SYSTEMS;

EID: 84880867136     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/REAL.1992.242650     Document Type: Conference Paper

References (16)

1. T. P. BAKER AND ALAN SHAW. The Cyclic Executive Model and Ada. The Journal of Real-Time Systems, 1, 7-25, 1989.
2. S. BARUAH, G. KOREN, B. MISHRA, A. RAGHU-NATHAN, L. ROSIER AND D. SHASHA. On-line Scheduling in the Presence of Overload,. Proc. of IEEE Foundations of Computer Science Conference, pp. 101-110, San Juan, Puerto Rico, October 1991.
3. S. BARUAH, G. KOREN, D. MAO,B. MISHRA, A. RAGHUNATHAN, L. ROSIER, D. SHASHA AND F. WANG. On The competitiveness of On-line Task Real-Time Task Scheduling,. The Journal of Real-Time Systems, 4, 124-144, 1992. Also, in Proc. of 1991 IEEE Real-Time Systems Symposium, San Antonio, Texas, pp. 106-115 December 1991.
4. M. DERTOUZOS. Control Robotics: the procedural control of physical processes. In Proc. IFIP congress, 1974, PP-807-813, 1974.
5. A. KARLIN, M. MANASSE, L. RUDOLPH, AND D. SLEATOR, Competitive Snoopy Caching, Algorith-mica 3, (1988), pages 79-119.
6. G. KOREN, B. MISHRA, A. RAGHUNATHAN AND D. SHASHA. On-Line Schedulers for Overload Real-time Systems,. Technical report no. 558, Courant Institute, NYU, May 1991.
7. G. KOREN, D. SHASHA. An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems,. Technical report no. 572, Courant Institute, NYU, July 1991.
8. G. KOREN, D. SHASHA. D-over: An Optimal On-Line Scheduling Algorithm for Overloaded Real-Time Systems,. Technical report no. 594, Courant Institute, NYU, January 1992. Also, Technical report no. 138, INRIA, Rocquencourt France, February 1992.
9. G. KOREN. Ph.D. thesis. Department of Computer Science, Courant Institute, NYU, to appear 1993.
10. C. L. Liu AND J. LAYLAND. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20:46-61, 1973.
11. C. DOUGLASS LOCKE. Best-EiFort Decision Making for Real-Time Scheduling. Doctoral Dissertation, Computer Science Department, Carnegie-Mellon University, 1986.
12. A. MOK. Fundamental Design Problems of Distributed Systems for the Hard Real-time environment. Doctoral Dissertation, M.I.T., 1983.
13. L. SHA, J. P. LEHOCZKY AND R. RAJKUMAR. Solutions for some Practical Problems in prioritized preemptive scheduling. Proceedings, Real-Time Systems Symposium, 1986.
14. D. SLEATOR AND R. TARJAN, Amortized Efficiency of List Update and Paging Rules, CACM 28, February 1985, pages 202-208.
15. JOHN A. STANKOVIC AND KRITHI RAMAMRITHM, The Spring Kernel: a new paradigm for real-time systems, IEEE Software, May 1991, pp. 62-72.
16. F. WANG AND D. MAO, Worst Case Analysis for On-Line Scheduling in Real-Time Systems. Technical Report 91-54, Department of Computer and Information Science, University of Massachusetts at Amherst, 1991.