A non-preemptive scheduling algorithm for soft real-time systems

Computers and Electrical Engineering

Volumn 33, Issue 1, 2007, Pages 12-29

  Li, Wenming ^a   Kavi, Krishna ^a   Akl, Robert ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Best effort scheduling; Earliest Deadline First (EDF); Group EDF; Non preemptive real time scheduling; Shortest Job First (SJF); Soft real time systems

Indexed keywords

ALGORITHMS; MULTIMEDIA SYSTEMS; SCHEDULING;

BEST-EFFORT SCHEDULING; EARLIEST DEADLINE FIRST (EDF); GROUP-EDF; NON-PREEMPTIVE REAL-TIME SCHEDULING; SHORTEST JOB FIRST (SJF); SOFT REAL-TIME SYSTEMS;

REAL TIME SYSTEMS;

EID: 33750715416     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compeleceng.2006.04.002     Document Type: Article

References (19)

1. Balarin F., Lavagno L., Murthy P., and Vincentelli A.S. Scheduling for embedded real-time systems. IEEE Des Test Comput January-March (1998)
2. Liu C.L., and Layland J.W. Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20 1 (1973) 46-61
3. Jain R, Hughes CJ, Adve SV. Soft real-time scheduling on simultaneous multithreaded processors. In: Proceedings of the 23rd IEEE international real-time systems symposium, December 2002.
4. Kavi K.M., Giorgi R., and Arul J. Scheduled dataflow: execution paradigm, architecture, and performance evaluation. IEEE Trans Comput 50 8 (2001)
5. Jeffay K., and Martel C.U. On non-preemptive scheduling of periodic and sporadic tasks. Proceedings of the 12th IEEE real-time systems symposium (1991), IEEE Computer Society Press, San Antonio, Texas 129-139
6. Garey M.R., and Johnson D.S. Computer and intractability, a guide to the theory of NP-completeness (1979), W.H. Freeman Company, San Francisco
7. Georges L, Muehlethaler P, Rivierre N. A few results on non-preemptive real-time scheduling. INRIA Research Report nRR3926, 2000.
8. Locke CD. Best-effort decision making for real-time scheduling, CMU-CS-86-134 (PhD Thesis), Computer Science Department, Carnegie-Mellon University, 1986.
9. Dey JK, Kurose J, Towsley D. Online processor scheduling for a class of IRIS (increasing reward with increasing service) real-time tasks, Tech. Rep. 93-09, January 1993, Department of Computer Science, University of Massachusetts, Amherst.
10. Zilberstein S. Using anytime algorithms in intelligent systems AI Magazine, Fall 1996, p. 71-83.
11. R. Heckmann, M. Langenbach, S. Thesing, R. Wilhelm. The influence of processor architecture on the design and the results of WCET tools. In: Proceedings of IEEE July 2003, Special issue on real-time systems.
12. Bernat G, Collin A, Petters SM. WCET analysis of probabilistic hard real-time systems, In: IEEE real-time systems symposium, 2002, p. 279-88.
13. Buttazzo G, Spuri M, Sensini F. Scuola Normale Superiore, Pisa, Italy, "Value vs. deadline scheduling in overload conditions, 16th IEEE real-time systems symposium (RTSS'95), December 05-07, 1995.
14. Baruah S.K., and Haritsa J.R. Scheduling for overload in real-time systems. IEEE Trans Comput 46 9 (1997)
15. Reddy ALN, Wyllie J. Disk Scheduling in Multimedia I/O system. In: Proceedings of ACM multimedia'93, Anaheim, CA, August 1993. p. 225-34.
16. Doytchinov B.D., Lehoczky J.P., and Shreve S.E. Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Annals Appl Probab 11 (2001)
17. Hansen JP, Zhu H, Lehoczky JP, Rajkumar R. Quantized EDF scheduling in a stochastic environment. In: Proceedings of the international parallel and distributed processing symposium, 2002.
18. Nieh J., and Lam M.S. A SMART scheduler for multimedia applications. ACM Trans Comput Sys 21 2 (2003)
19. Abdelzaher T., Sharma V., and Lu C. A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput March (2004)