Associative prioritized worker model with priority inheritance protocol

Synchronization and communication are two common sources of priority inversion that may make the behavior of systems unpredictable and analyzable. In real-time systems, to predict the timing constraints of applications, we need to solve the priority inversion problem using the priority inheritance protocol. This requires a real-time server model that would provide us with better preemptability without affecting the overhead of the real-time system. However, the traditional real-time server model is not able to solve the trade-off between the high preemptability and the low overhead of the real-time system. We propose an associative prioritized worker model as a new real-time server model that solves the problems mentioned. Our approach enables us to build operating system servers and to decompose applications into several tasks without the priority inversion problem.