Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
While a number of researchers have proposed excellent protocols on resource synchronization, little work is done for processes that might suspend themselves for I/O access, especially when they tend to be more tolerant to multiple priority inversions. This paper presents research results extended from the concept of priority ceilings with an objective to satisfy different priority-inversion requirements for different processes. We aim at practical considerations in which processes might voluntarily give up CPU and be willing to receive more blocking time than those in most traditional approaches. Extensions on the proposed scheduling protocols for deadlock prevention are also considered.