Uniprocessor Scheduling

Write a program to simulate Round Robin (q=1) (RR), Shortest Process Next (SPN), First Come First Serve (FCFS), and Shortest Remaining Time (SRT). Run at 1,000 simulations. Each simulation needs to include 20 processes which require a randomly determined amount of execution time in the range of [1,10]. The each job becomes available at the time of twice its index (i.e., job 0 is available at time 0, job 17 is available at time 34).

Draw a conclusion as to which of these scheduling algorithms are best under these circumstances.

Round Robin: A clock interrupt is generated at periodic intervals. When the interrupt occurs, the currently running process is placed in the ready queue, and the next ready job is selected on a FCFS basis. This technique is also known as time slicing because each process is given a slice of time before being preempted. With round robin, the principal design issue is the length of the time quantum (q), or slice, to be used.