Relaxed Co-Scheduling

Most important of all, while in the strict co-scheduling algorithm, the existence of a lagging vCPU causes the
entire virtual machine to be co-stopped. In the relaxed co-scheduling algorithm, a leading vCPU decides whether
it should co-stop itself based on the skew against the slowest sibling vCPU. If the skew is greater than a threshold,
the leading vCPU co-stops itself. Note that a lagging vCPU is one that makes significantly less progress than the
fastest sibling vCPU, while a leading vCPU is one that makes significantly more progress than the slowest sibling
vCPU. By tracking the slowest sibling vCPU, it is now possible for each vCPU to make its own co-scheduling
decision independently.