A scheduling policy determines how a new process is chosen for execution. The policy should be distinguished from the mechanism used to enforce it. We describe here the Xinu scheduling policy. The mechanisms are described later.
The Xinu scheduling policy has three components:
Each process is associated with a priority.
The highest priority ready process is always chosen for execution.
Among processes with equal priority scheduling is round-robin.
By round-robin we mean that processes are selected one after another so that
all members of a set have an opportunity to execute before any member has a