Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive fixed priority scheduling

International Journal of Production Research

Volumn 42, Issue 14, 2004, Pages 2899-2913

  Koubaa, A ^a   Song, Y Q ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; JITTER; ROUTERS; SCHEDULING; SET THEORY; SWITCHES; TRAJECTORIES;

FIXED PRIORITY SCHEDULING; INTERNETWORKING DEVICES; NETWORK CALCULUS;

REAL TIME SYSTEMS;

EID: 3142539460     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540410001705211     Document Type: Conference Paper

References (19)

1. AUDSLEY, N., BURNS, A., RICHARDSON, M., TINDELL, K. and WELLINGS, A., 1993, Applying new scheduling theory to static priority pre-emptive scheduling. Software Engineering Journal, 8, 284-292.
2. BRIAND, P. and ROY, M., 1999, Meeting Deadlines in Hard Real-Time Systems, The Rate Monotonic Approach (Los Alamitos, CA: IEEE Computer Society).
3. BURNS, A., NICHOLSON, M., TINDELL, K. and ZHANG, 1993, Allocating and scheduling hard real-time tasks on a point-to-point distributed system. Proceedings of the Workshop on Parallel and Distributed Real-Time Systems, Newport Beach CA, pp. 11-20.
4. CHANG, C. S., 2000, Performance Guarantees in Communication Networks (New York: Springer).
5. CRUZ, R. L., 1991a, A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory, 37, 114-131.
6. CRUZ, R. L., 1991b, A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory, 37, 132-141.
7. GEORGES, J. P., RONDEAU, E. and Divoux, T., 2002, Evaluation of switched Ethernet in an industrial context by using Network Calculus. IEEE International Workshop on Factory Communication Systems, Sweden.
8. GEORGES, L., MÜHLETHALER, P. and RIVIERRE, N., 2000, A Few Results on Non-Preemptive Real-Time Scheduling. Research Report No. RR3926 (INRIA).
9. HANSSON, H. and SJÖDIN, M., 1997, Response time guarantees for ATM-networked control systems. IEEE International Workshop on Factory Communication Systems, Barcelona, Spain.
10. HLADIK, P. E. and DÉPLANCHE, A. M., 2003, Ordonnancement préemptif à priorités fixes: comparaison de méthodes analytiques de calcul de pire temps de réponse. RTS'2003, pp. 307-332.
11. JASPERNEITE, J., NEUMANN, P., THEIS, M. and WATSON, K., 2002, Deterministic real-time communication with switched Ethernet. IEEE International Workshop on Factory Communication Systems, Sweden.
12. JEFFAY, K., STANAT, D. F. and MARTEL, C. U., 1991, On non-preemptive scheduling of periodic and sporadic tasks. IEEE Real-Time Systems Symposium, San Antonio, TX, USA, pp. 129-139.
13. JOSEPH, M. and PANDYA, P., 1986, Finding response time in a real-time system. BCS Computer Journal, 29, 390-395.
14. LE BOUDEC, J. Y. and THIERAN, P., 2002, A Theory of Deterministic Queueing Systems for the Internet (Springer)-Lecture Notes in Computer Science 2050 [on-line].
15. LEHOCZKY, J. P., 1990, Fixed priority scheduling of periodic task sets with arbitrary deadlines. IEEE Real-Time System Symposium, Los Alamitos, CA, USA, pp. 201-209.
16. Liu, C. L. and LAYLAND, J. W., 1973, Scheduling algorithms for multiprogramming in hard real-time environment. Journal of ACM, 20, 46-61.
17. SJÖDIN, M. and HANSSON, H., 1998, Improved response time analysis calculations. IEEE Real-time Systems Symposium, Madrid, Spain.
18. SONG, Y. Q., KOUBÂA, A. and SIMONOT, F., 2002, Switched Ethernet for real-time industrial communication: modelling and message buffering delay evaluation. IEEE International Workshop on Factory Communication Systems, Sweden, pp. 27-35.
19. TINDELL, K., 1994, Fixed priority scheduling of hard real-time systems. PhD thesis, Department of Computer Science, University of York.