Consider a system with a high priority process H and a low priority process L.

The processes share the same critical region, and use busy waiting to test whether they are able to enter the critical region.

At one point in time, L is in the critical region and H becomes ready to run after completion of an I/O operation.

One approach is to use priority scheduling, but it would only work if every process had the same priority. So if a process with a different priority enters the system, you would get the Priority Inversion Problem...

So my question is, why is Round Robin a better algorithm to use? It avoids the Priority Inversion Problem, but how? I cannot seem to find a definitive answer to this...