Avoiding Unbounded Priority Inversion by Integrating Task Inheritance and Classification into Preemption Threshold Scheduling
Tao Wang, Daxin Liu
Abstract
Tao Wang, Daxin Liu
Abstract
This paper considers the uncontrolled priority inversion problem occurs when a higher-priority thread is suspended because a lower-priority thread has a needed resource. A new strategy is presented to prevent uncontrolled priority inversion which integrates the priority inheritance protocol, the priority ceiling protocol, and the task classification based upon the priority of their subtasks relative to the task into preemption threshold scheduling. The new strategy provides schedulability improvement and reduces the excessive preemption overhead
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper considers the uncontrolled priority inversion problem occurs when a higher-priority thread is suspended because a lower-priority thread has a needed resource. A new strategy is presented to prevent uncontrolled priority inversion which integrates the priority inheritance protocol, the priority ceiling protocol, and the task classification based upon the priority of their subtasks relative to the task into preemption threshold scheduling. The new strategy provides schedulability improvement and reduces the excessive preemption overhead
Key concepts: Priority inversion, Priority inheritance, Priority ceiling protocol, Computer science, Preemption, Deadline-monotonic scheduling, Distributed computing, Scheduling (production processes)