Scheduling Techniques

Question 1

First Come, First Served -

Answer 1

First Come, First Served
As the name suggests.
• Poor Efficiency

Question 2

Round Robin

Answer 2

Each process has a set number of processing time. Processor switches in a circular fashion
• Easy Implementation
• Can be inefficient
• Time can be lost waiting for
inputs

Question 3

Shortest Job First

Answer 3

The process with the shortest processing time is processed

• Long Process can be waiting a long time - processor starvation

Question 4

Shortest Time Remaining

Answer 4

The process with the shortest remaining processing time is
processed. If another job with a shorter time remaining arrives, it will switch
• Short jobs executed quickly
• Starvation can still occur

Question 5

Multi-Level Queue

Answer 5

Processes are given a priority when they arrive, dep. on their time remaining, process type and memory size.
• Important jobs processed first

Question 6

Multi-level Feedback Queue

Answer 6

Same as a MLQ but the
processor can change the priority of a process, most likely due to a process taking up too much
processing time.
• Stops starvation
• Allows interactivity
• Priorities can be changed