Study of priority inversion in embedded RTOS
Ping Li
Abstract
Ping Li
Abstract
Aiming at the characteristics of the task scheduling in embedded real-time system that the task may be cut off by task with higher priority grade while running,this paper analyzed the searching algorithm of the most priority ready task in embedded RTOS,and pointed out that in the algorithm exists priority inversion of(different) priority tasks.The paper provided priority inheritance for solving the problem of priority inversion in task scheduling.
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.
Aiming at the characteristics of the task scheduling in embedded real-time system that the task may be cut off by task with higher priority grade while running,this paper analyzed the searching algorithm of the most priority ready task in embedded RTOS,and pointed out that in the algorithm exists priority inversion of(different) priority tasks.The paper provided priority inheritance for solving the problem of priority inversion in task scheduling.
Key concepts: Priority inversion, Priority inheritance, Priority ceiling protocol, Computer science, Real-time operating system, Deadline-monotonic scheduling, Earliest deadline first scheduling, Inversion (geology)