Schedulability analysis of resource access control protocols in real-time systems

To guarantee the timing requirements of real-time systems are satisfied, the timing behavior of the systems must be predictable. Priority driven scheduling algorithms, such as the earliest deadline first algorithm, are known to be effective and predictable in scheduling independent tasks. However, when concurrent tasks share resources in a mutually exclusive manner, the timing behavior of the system becomes less predictable. Due to the conflict in accessing shared resources, a high priority task may have to wait for the execution of a low priority task, a phenomenon called priority inversion, causing it to miss its deadline requirement. To minimize the occurrences of priority inversion in using the earliest deadline first algorithm, we proposed two resource access control protocols to coordinate the accesses to shared resources. The dynamic priority ceiling is used when every shared resource is unique and can be identified by the tasks using it. When two or more shared resources provide the same service and can be used interchangeably, the generalized priority ceiling protocol is used. We analyzed the properties of these two protocols, and showed that they are effective in making the timing behavior of tasks more predictable.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Chen, Min-Ih

Contributors dc:contributor

• Lin, Kwei-Jay

• Computer Science

Statement dc:rights

• Copyright 1991 Chen, Min-Ih

Language dc:language

eng

Identifier

AAI9210764
(UMI)AAI9210764

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23252