DocumentCode
2711028
Title
The ceiling adjustment scheme for improving the concurrency of real-time systems with mixed workloads
Author
Kim, Joo-Yong ; Son, Sang Hyuk ; Koh, Kern
Author_Institution
Dept. of Comput. Sci., Seoul Nat. Univ., South Korea
fYear
1997
fDate
11-15 Aug 1997
Firstpage
72
Lastpage
75
Abstract
Priority inversion is one of the problems which may prevent the guarantee of hard deadline task executions. The priority ceiling protocol (PCP) could be a solution to the priority inversion problem. However, the single blocking property of PCP is sometimes very restrictive. The authors propose a new protocol called ceiling adjustment scheme (CAS), which adjusts the ceilings of shared resources by using the slack blocking time of hard deadline tasks while meeting their deadlines. The simulation study shows that CAS experiences significantly reduced number of blockings (priority inversions) compared to that of PCP, and hence it achieves faster response times and reduced miss rates of soft deadline tasks under overload situations
Keywords
concurrency control; processor scheduling; protocols; real-time systems; virtual machines; ceiling adjustment scheme; hard deadline task execution; hard deadline tasks; improved real-time system concurrency; miss rates; mixed workloads; overload situations; priority ceiling protocol; priority inversion problem; response times; shared resource ceilings; simulation; slack blocking time; soft deadline tasks; Access protocols; Computer science; Concurrency control; Concurrent computing; Content addressable storage; Delay; Real time systems; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1997. COMPSAC '97. Proceedings., The Twenty-First Annual International
Conference_Location
Washington, DC
ISSN
0730-3157
Print_ISBN
0-8186-8105-5
Type
conf
DOI
10.1109/CMPSAC.1997.624757
Filename
624757
Link To Document