DocumentCode :
2348243
Title :
Aperiodic servers with resource constraints
Author :
Caccamo, Marco ; Sha, Lui
Author_Institution :
Scuola Superiore S. Anna, Pisa, Italy
fYear :
2001
fDate :
3-6 Dec. 2001
Firstpage :
161
Lastpage :
170
Abstract :
Integrating soft and hard activities in a real-time environment has been an active area of research both under fixed priority scheduling and dynamic priority scheduling. Most of the existing work, however, has been done under the assumption that soft real-time tasks and hard real-time tasks are independent. The paper presents an efficient method that allows soft realtime aperiodic tasks and hard real-time tasks to share resources.
Keywords :
processor scheduling; real-time systems; resource allocation; dynamic priority scheduling; fixed priority scheduling; hard real-time tasks; real-time environment; resource constraints; share resources; soft realtime tasks; Bandwidth; Delay; Dynamic scheduling; Kernel; Open systems; Processor scheduling; Protocols; Resource management; Scheduling algorithm; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems Symposium, 2001. (RTSS 2001). Proceedings. 22nd IEEE
Print_ISBN :
0-7695-1420-0
Type :
conf
DOI :
10.1109/REAL.2001.990607
Filename :
990607
Link To Document :
بازگشت