An Efficient Non-Preemptive Real-Time Scheduling

18th ISCA International Conference on Parallel and Distributed Computing Systems 2005, PDCS 2005

Volumn , Issue , 2005, Pages 154-160

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

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Approximate Computations; Best Effort Scheduling; Earliest Deadline First (EDF); Real time scheduling; Shortest Job First (SJF)

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATE COMPUTATION; BEST-EFFORT; BEST-EFFORT SCHEDULING; EARLIEST DEADLINE FIRST; EARLY DEADLINE FIRST; NON-PREEMPTIVE; PRE-EMPTIVE SCHEDULING; REAL - TIME SYSTEM; REAL TIME SCHEDULING; SHORT JOB FIRST;

REAL TIME SYSTEMS;

EID: 34547591919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. F. Balarin, L. Lavagno, P. Murthy, and A. S. Vincentelli, “Scheduling for Embedded Real-Time Systems”, IEEE Design & Test of Computer, January-March, 1998.
2. C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”, Journal of the ACM, Vol. 20, No. 1, pp. 46-61.
3. rd IEEE International Real-Time Systems Symposium, December 2002.
4. K. M. Kavi, R. Giorgi, and J. Arul, “Scheduled Dataflow: Execution Paradigm, Architecture, and Performance Evaluation”, IEEE Transactions on Computers, Vol. 50, No. 8, August 2001.
5. th IEEE Real-Time Systems Symposium, San Antonio, Texas, December 1991, IEEE Computer Society Press, pp. 129-139.
6. M. R. Garey, D. S. Johnson, “Computer and Intractability, a Guide to the Theory of NP-Completeness”, W. H. Freeman Company, San Francisco, 1979.
7. L. Georges, P. Muehlethaler, N. Rivierre, “A Few Results on Non-Preemptive Real-time Scheduling”, INRIA Research Report nRR3926, 2000.
8. C. D. Locke, “Best-effort Decision Making for Real-Time Scheduling”, CMU-CS-86-134 (PhD Thesis), Computer Science Department, Carnegie-Mellon University, 1986.
9. J. K. Dey, J. Kurose, and D. Towsley, “Online Processor Scheduling for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks”, Tech. Rep. 93-09, Department of Computer Science, University of Massachusetts, Amherst, Jan 1993.
10. S. Zilberstein, “Using Anytime Algorithms in Intelligent Systems”, AI Magazine, fall 1996, pp.71-83.
11. R. Heckmann, M. Langenbach, S. Thesing, and R. Wilhelm, “The Influence of Processor Architecture on the Design and the Results of WCET Tools”, Proceedings of IEEE July 2003, Special Issue on Real-time Systems.
12. G. Bernat, A. Collin, and S. M. Petters, “WCET Analysis of Probabilistic Hard Real-Time Systems”, IEEE Real-Time Systems Symposium 2002, 279-288.
13. th IEEE Real-Time Systems Symposium (RTSS’95) December 05-07, 1995.
14. S. K. Baruah and J. R. Haritsa, “Scheduling for Overload in Real-Time Systems”, IEEE Transactions on Computers, Vol. 46, No. 9, September 1997.
15. A. L. N. Reddy and J. Wyllie, “Disk Scheduling in Multimedia I/O system”, In Proceedings of ACM multimedia’93, Anaheim, CA, 225-234, August 1993.
16. B. D. Doytchinov, J. P. Lehoczky, and S. E. Shreve, “Real-Time Queues in Heavy Traffic with Earliest-Deadline-First Queue Discipline”, Annals of Applied Probability, No. 11, 2001.
17. J. P. Hansen, H. Zhu, J. Lehoczky, and R. Rajkumar, “Quantized EDF Scheduling in a Stochastic Environment”, Proceedings of the International Parallel and Distributed Processing Symposium, 2002.