However, this scheduling scheme is vulnerable to process or thread  lockout: since priority is given to higher-priority tasks, the lower-priority tasks could wait an indefinite amount of time. One common method of arbitrating this situation is aging, which gradually increments the priority of waiting processes and threads, ensuring that they will all eventually execute.
The scheduling strategy faces a risk of deadlock due to prioritizing higher-priority tasks. To address this, aging is employed, a process that progressively elevates the priority of waiting processes and threads until they all get executed.