A Prioritized Distributed Mutual Exclusion Algorithm Balancing Priority Inversions and Response Time
Distributed priority-based mutual exclusion algorithms may present starvation for low priority requests if the shared resource is continuously asked by high priority requests. To address this problem, several existing algorithms dynamically increment the priority of pending low-priority requests. The drawback of this approach is that it may lead to a great number of priority inversions, i.e., a pending request p is satisfied before another one whose priority is higher than p's. One solution to reduce this number, as the authors have proposed in, is to both postpone priority increments and prevent low priorities from increasing too fast.