Note that your final mark will not be saved in the system.
3. Systems Software Typeit
Type the correct answers into the spaces. Fill all the spaces before clicking ‘Check Answers!’
Scheduling algorithms vary from system to system, depending on a number of factors. The following are the most commonly-used:
assigns each process a fixed time slice. If, by the end of the time slice, a process is complete, it leaves the ready queue altogether. If not, it returns to the back of the queue to wait its turn.
is probably the most simple approach, in which each process is executed in full in the order in which it entered the ready queue.
works slightly differently. After the previous job has been dealt with, the scheduler looks through the ready queue, selecting the process that it predicts will require the smallest amount of CPU time. It is then executed in full, and the process repeats.
begins by executing the process that should require the least amount of time. If, while that is taking place, another process is created that requires less time than what's left of the current process, the remains of the current process are returned to the queue while the new process is executed.
A - is an approach that can use different algorithms as part of an overall approach. A process enters a ready queue and, in due course, begins execution. If it is not completed, according to whatever rules govern that queue, is joins the back of a different queue, which might belong to an algorithm that assigns a larger time slice.