EDL server for scheduling periodic and soft aperiodic tasks with resource constraints

Real-Time Systems

Volumn 17, Issue 1, 1999, Pages 87-111

  Silly, Maryline ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; CONSTRAINT THEORY; NETWORK PROTOCOLS; RESPONSE TIME (COMPUTER SYSTEMS);

DYNAMIC PRIORITY CEILING PROTOCOLS; SOFT APERIODIC TASKS;

REAL TIME SYSTEMS;

EID: 0032664624     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008093629946     Document Type: Article

References (23)

1. Baker, T. P. 1990. Stack-based scheduling of real-time processes. Proc. of IEEE Real-Time Systems Symp., pp. 191-200.
2. Chen, M. I., and Lin, K. J. 1990. Dynamic priority ceilings: a concurrency control protocol for real-time systems. Real-Time Systems Journal 2(4): 325-346.
3. Chen, M. I. 1991. Schedulability Analysis of Resource Access Control Protocols in Real-Time Systems. Technical report no. UIUCDCS-R-91-1705, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 109 pages.
4. Chetto, H., and Chetto-Silly, M. 1989. Some results of the earliest deadline scheduling algorithm. IEEE Trans. on SW Eng. 18(8): 736-748.
5. Davis, R. I., Tindel, K. W., and Burns, A. 1993. Scheduling slack time in fixed pre-emptive systems. Proc. of IEEE Real-Time Systems Symp., pp. 222-231.
6. Ghazalie, T. M., and Baker, T. P. 1995. Aperiodic servers in a deadline scheduling environment. The Journal of Real-Time Systems 9(5): 31-66.
7. Lehoczky, J. P., Sha, L., and Strosnider, J. K. 1987. Enhanced aperiodic scheduling in hard-real-time environments. Proc. of IEEE Real-Time Systems Symp., pp. 261-270.
8. Lehoczky, J. P., and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. Proc. of IEEE Real-Time Systems Symp, pp. 110-123.
9. Leung, J. Y. T., and Merril, M. L. 1980. A note on preemptive scheduling of periodic real-time tasks. Information Processing Letters 11(3): 115-118.
10. 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.
11. Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1): 40-61.
12. Mok, A. K. 1984. The design of real-time programming systems based on process models. Proc. of IEEE Real-Time Systems Symp., pp. 5-7.
13. Mok, A. K. 1987. Programming language support for distributed real-time applications. Technical Report, Department of Computer Science, University of Texas at Austin, pp. 5-7.
14. Ramos-Thuel, S. and Lehoczky, J. P. 1993. On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems. Proc. of IEEE Real-Time Systems Symp., pp. 160-171.
15. Ripoll, I., Crespo, A., and Garcia-Fornes, A. 1997. An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems. IEEE Trans, on Soft. Eng. 23(6): 388-400.
16. Sha, L., Rajkumar, R., and Lehoczky, J. P. 1990. Priority inheritance protocols: An approach to real-time synchronisation. IEEE Trans. on Computers 39(9): 1175-1185.
17. Silly, M. 1994. A dynamic scheduling algorithm for semi-hard real-time environments. Proc. of 6th Euromicro Workshop on Real-Time Systems, pp. 130-137.
18. Sprunt, B., Lehoczky, J. P., and Sha, L. 1988. Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm. Proc. of IEEE Real-Time Systems Symp., pp. 251-258.
19. Sprunt, B., Sha, L., and Lehoczky, J. P. 1989. Aperiodic task scheduling for hard-real-time systems. The Journal of Real-Time Systems 1: 27-60.
20. Spuri, M., and Buttazzo, G. C. 1994. Efficient aperiodic scheduling under earliest deadline scheduling. Proc. of IEEE Real-Time Systems Symp., pp. 2-11.
21. Spuri, M., and Stankovic, J. A. 1994. How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Trans. on Computers 43(12): 1407-1412.
22. 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. on Computers 44(1): 73-91.
23. Tia, T. S., Liu, J. W. S., and Shankar, M. 1996. Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems. The Journal of Real-Time Systems 10: 23-43.