DocumentCode
3507691
Title
New results on fixed priority aperiodic servers
Author
Bernat, Guillem ; Burns, Alan
Author_Institution
Real-Time Syst. Res. Group, York Univ., UK
fYear
1999
fDate
1999
Firstpage
68
Lastpage
78
Abstract
The issue of using the sporadic server (SS) for scheduling aperiodic tasks has received new attention under the POSIX standard as it has been proposed in P1003.1 d, the additional real-time extensions to POSIX. The SS has been traditionally considered a better approach to the deferrable server (DS) due to its supposed higher achievable utilisation. However, SS also has higher implementation complexity. Nevertheless, the analysis of the comparisons performed from several authors between DS and SS is not conclusive. A review on fixed priority servers is presented with a new parameter selection technique and comprehensive performance analysis based on simulation techniques. With this parameter selection, it is shown that no server performs significantly better than the other in most of the situations. This suggests that future POSIX revisions for real-time support should also consider mechanisms by which other types of servers could be implemented
Keywords
Unix; computational complexity; processor scheduling; POSIX standard; deferrable server; fixed priority aperiodic servers; fixed priority servers; implementation complexity; parameter selection; real-time support; scheduling; Delay; Electronic switching systems; Interference; Read only memory; Real time systems; Runtime; System testing; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium, 1999. Proceedings. The 20th IEEE
Conference_Location
Phoenix, AZ
ISSN
1052-8725
Print_ISBN
0-7695-0475-2
Type
conf
DOI
10.1109/REAL.1999.818829
Filename
818829
Link To Document