DocumentCode
3209585
Title
Scheduling aperiodic requests under the rate-based execution model
Author
Goddard, Steve ; Liu, Xin
Author_Institution
Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA
fYear
2002
fDate
2002
Firstpage
15
Lastpage
25
Abstract
Aperiodic requests with unknown execution times and unknown arrival patterns are dynamically mapped to rate-based execution (RBE) tasks with variable rates and scheduled such that the real-time tasks are guaranteed to meet their deadlines. The aperiodic requests dynamically share the available processor capacity without reserving a fixed processor capacity for any one aperiodic request (or class of requests). This approach was selected over the traditional approach of using a static set of server tasks to process aperiodic requests so that the available processor capacity could be proportionally shared between active aperiodic requests.
Keywords
algorithm theory; processor scheduling; real-time systems; aperiodic request scheduling; dynamic available processor capacity sharing; dynamic mapping; guaranteed deadline meeting; rate-based execution model; rate-based execution tasks; real-time tasks; static server tasks; unknown arrival patterns; unknown execution times; variable rates; Bandwidth; Base stations; Computer science; Dynamic scheduling; Load modeling; Mobile robots; Processor scheduling; Real time systems; Robot sensing systems; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium, 2002. RTSS 2002. 23rd IEEE
ISSN
1052-8725
Print_ISBN
0-7695-1851-6
Type
conf
DOI
10.1109/REAL.2002.1181558
Filename
1181558
Link To Document