Dynamic real-time scheduling of firm periodic tasks with hard and soft aperiodic tasks

Real-Time Systems

Volumn 32, Issue 1-2, 2006, Pages 21-47

  Marchand, Audrey ^a   Silly Chetto, Maryline ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

Aperiodic tasks; Dynamic scheduling; Earliest deadline; Periodic tasks; Quality of service; Real time; Sporadic tasks

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY OF SERVICE; SCHEDULING;

APERIODIC TASKS; DYNAMIC SCHEDULING; EARLIEST DEADLINE; PERIODIC TASKS; SPORADIC TASKS;

REAL TIME SYSTEMS;

EID: 33746931688     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-006-4962-8     Document Type: Article

References (25)

1. Buttazzo, G.-C., and Caccamo, M. 1999. Minimizing aperiodic response times in a firm real-time environment. IEEE Transactions on Computers, 48(10): 1035-1052.
2. Buttazzo, G.-C., and Sensini, F. 1999. Optimal deadline assingnment for scheduling soft aperiodic tasks in hard real-time environments. IEEE Transactions on Software Engineering, 25(1): 22-32.
3. Caccamo, M., and Buttazzo, G. 1997. Exploiting skips in periodic tasks for enhancing aperiodic responsiveness. Proceedings of the 18th IEEE Real-Time Systems Symposium.
4. Caccamo, M., and Buttazzo, G. 1998. Optimal scheduling for fault-tolerant and firm real-time systems. Proceedings of the IEEE Real-Time Computing Systems and Applications.
5. Chetto, H., and Chetto, M. 1989. Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering, 15(10): 1261-1269.
6. Chetto, H., Ghetto, M. and Bouchentouf, T. 1990. Dynamic scheduling of real-time tasks under precedence constraints. The Journal of Real-Time Systems, 181-194.
7. Davis, R.-I., Tindell, K.-W., and Burns, A. 1993. Scheduling slack time in fixed priority preemptive systems. Proceedings of the Real-Time Systems Symposium, pp. 222-231.
8. Ghazalie, T.-M., and Baker, T.-P. 1995. Aperiodic servers in a deadline scheduling environment. The Journal of Real-Time Systems, 9: 21-36.
9. Hamdaoui, M., and Ramanathan, P. 1995. A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Transactions on Computers, 44(4): 1443-1451.
10. Koren, G., and Shasha, D. 1995. Skip-over algorithms and complexity for overloaded systems that allow skips. In Proceedings of the 16th IEEE Real-Time Systems Symposium.
11. Lehoczky, J.-P., and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of the 13th IEEE Real-Time Systems Symposium, pp. 110-123.
12. Lehocsky, J.-P., Sha, J.-P., and Strosnider, K.-K. 1987. Enhanced aperiodic responsiveness in hard real-time environments. Proceedings of the IEEE Real-Time Systems Symposium, pp. 261-270.
13. Leung, J.-Y.-T., and Whitehead, J. 1982. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation, 2: 237-250.
14. Liu, J.-W.-S. 2000. Real-Time Systems. Prentice-Hall.
15. Liu, C.-L., and Layland, J.-W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the Association for Computing Machinery, 20(1): 46-61.
16. Ripoll, I., Crespo, A., and Garcia-Fornes, A. 1997. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Transactions on Software Engineering, 23(6): 388-400.
17. Silly, M. The EDL Server for scheduling periodic and soft aperiodic tasks with resource constraints. The Journal of Real-Time Systems, 17: 1-25.
18. Silly, M., Chetto, H., and Elyounsi, N. 1990. An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. IEEE Symposium on Parallel and Distributed Processing, pp. 578-585.
19. Sprant, B., Sha, L., and Lehoczky, J.-P. 1989. Aperiodic task sheduling for hard-real-time systems. The Journal of Real-Time Systems, 1: 27-60.
20. Spuri, M., and Buttazzo, G.-C. 1994. Efficient aperiodic service under earliest deadline scheduling. In Proceedings of the IEEE Real-Time Systems Symposium.
21. Spuri, M., Buttazzo, G.-C., and Sensini, F. 1995. Robust aperiodic scheduling under dynamic priority systems. In Proceedings of the IEEE Real-Time Systems Symposium.
22. Spuri, M., and Buttazzo, G.-C. 1996. Scheduling aperiodic tasks in dynamic priority systems. The Journal of Real-Time Systems, 10(2).
23. Strosnider, J.-K., Lehoczky, J.-P., and Sha, L. 1995. The Deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments. IEEE Trans. Computer, 44(1).
24. Stankovic, J.-A. 1988. A serious problem for next-generation systems. IEEE Computer, 21(10): 10-19.
25. Tia, T.-S., Liu, J.-W.-S., and Shankar, M. 1995. Algorithms and optimally of scheduling aperiodic requests in fixed-priority preemptive systems. The Journal of Real-Time Systems.