Non-preemptive earliest-deadline-first scheduling policy: A performance study

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn 2005, Issue , 2005, Pages 201-208

  Kargahi, Mehdi ^a   Movaghar, Ali ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; MARKOV PROCESSES; PARAMETER ESTIMATION; QUEUEING NETWORKS; SCHEDULING; SERVERS;

SINGLE SERVER QUEUE; TRANSIENT FAULTS; VIRTUAL SUBSYSTEMS;

REAL TIME SYSTEMS;

EID: 33646948262     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOTS.2005.44     Document Type: Conference Paper

References (32)

1. F. Baccelli, P. Boyer, and G. Hebuterne. Single-server Queues with Impatient Customers. Adv. Appl. Probab., 16:887-905, 1984.
2. D. Y. Barrer. Queueing with Impatient Customers and Ordered Service. Oper. Res., 5:650-656, 1957.
3. A. Brandt and M. Brandt. On the M(n)/M(n)/s Queue with Impatient Calls. Performance Evaluation, 35:1-18, 1999.
4. A. Brandt and M. Brandt. Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System. Queueing Systems, 41:73-94, 2002.
5. CAN-CIA. CAN specification 2.0 Part B. http://www.cancia.org/downloads/ ciaspecifications, 1992.
6. X. Castillo, S.R. McConnel, and D.P. Siewiorek. Derivation and Caliberation of a Transient Error Reliability Model. IEEE Trans. on Computers, 31(7):658-671, 1982.
7. J. W. Cohen. Single server queue with uniformly bounded virtual waiting time. J. Appl. Prob., 5:93-122, 1968.
8. D. J. Daley. General Customer Impatience in Queue GI/G/1. J. Appl. Probab., 2:186-205, 1965.
9. S. Dolev and A. Keizelman. Non-preemptive real-time scheduling of multimedia tasks. Real-Time Systems. 17(1):23-39, 1999.
10. B. Doytchinov, J. Lehoczky, and S. Shreve. Real-Time Queues in Heavy Traffic with Earliest-Deadline-First Queue Discipline. Annals of Appl. Probab., 11:332-379, 2001.
11. EN 50170. General purpose field communication system. In European Standard, CENELEC, 1996.
12. L. George, P. Muhlethaler, and N. Rivierre. Optimality and Non-Preemptive Real-Time Scheduling Revisited. Rapport de Recherche RR-2516, INRIA, Le Chesnay Cedex, France, 1995.
13. L. George, N. Rivierre, and M. Spuri. Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling. Rapport de Recherche RR-2966, INRIA, Le Chesnay Cedex, France, 1996.
14. ndIEEE/ACM International Symposium on Computer Architecture (ISCA '05), pages 172-183, June 2005.
15. J. Hong, X. Tan, and D. Towsley. A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System. IEEE Transactions on Computers, 38(12):1736-1744, 1989.
16. R.K. Iyer, D.J. Rossetti, and M.C. Hsueh. Measurement and Modeling of Computer Reliability as Affected by System Activity. ACM Trans. on Computer Systems, 4(3):214-237, 1986.
17. M. Kargahi and A. Movaghar. A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy. Proceedings of IEEE International Conference on Dependable Systems and Networks (DSN'04), pages 826-834, June 2004.
18. L. Kruk, J. Lehoczky, S. Shreve, and S. N. Yeung. Earliest-Deadline-First Service in Heavy-Traffic Acyclic Networks. Annals of Appl. Probab., 14(3): 1306-1352, 2004.
19. J. P. Lehoczky. Real-Time Queueing Theory. Proceedings of IEEE Real-Time Systems Symposium, pages 186-195, 1996.
20. J. P. Lehoczky. Using Real-Time Queueing Theory To Control Lateness In Real-Time Systems. Performance Evaluation Review, 25(1):158-168, 1997.
21. th Symposium on Parallel and Distributed Processing (IPPS/SPDP'98), pages 1088-1097, 1998.
22. C. L. Liu, and Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. J. Assoc. Compu., 20:46-61, 1973.
23. A. Movaghar. On Queueing with Customer Impatience Until the Begining of Service. Queueing Systems, 29:337-350, May 1998.
24. A. Movaghar. On queueing with customer impatience until the end of service. Proceedings of IEEE International Computer Performance and Dependability Symposium, pages 167-174, March 2000 (also to appear in Stochastic Models).
25. C. Palm. Methods for judging the annoyance caused by congestion. Tele, 2:1-20, 1953.
26. S. S. Panwar, and D. Towsley. On the Optimality of the STE rule for Multiple Server Queues that Serve Customers with Deadlines. COINS Technical Report 88-81, Dep. Comput Inform. Sci., University of Massachusetts, July 1988.
27. S. S. Panwar, D. Towsley, and J. K. Wolf. Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service. J. Assoc. Comput., 35(4):832-844, October 1988.
28. D. P. Siewiorek, V. Kini, H. Mashburn, S. McConnel, and M. Tsao. A case Study of C.mmp, Cm* and C.vmp: Part 1-Experiences with Fault Tolerance in Multiprocessor Systems. Proceedings of the IEEE, 66(10):1178-1199, Oct. 1978.
29. L. Takacs. A single-server queue with limited virtual waiting time. J. Appl. Prob., 11:612-617, 1974.
30. D. Towsley and S. S. Panwar. Optimality of the Stochastic Earliest Deadline Policy for the G/M/c Queue Serving Customers with Deadlines. Second ORSA Telecommunications Conference, March 1992.
31. D. Towsley and S.S. Panwar. On the Optimality of Minimum Laxity and Earliest Deadline Scheduling for Real-Time Multiprocessors. Proceedings of IEEE EUROMICRO-90 Workshop on Real-Time, pages 17-24, June 1990.
32. W. Zhao and J. A. Stankovic. Performance Analysis of 7 FCFS and Improved FCFS Scheduling Algorithms for Dynamic Real-Time Computer Systems. Proceedings of IEEE Real-Time Systems Symposium, pages 156-165, 1989.