Question

For Shortest Remaining Time,

• What is the arrival time, completion time, burst time, turnaround time, and the waiting time?
• discuss these terms further as they pertain to the efficiency of the algorithm as well as properties such as starvation.
• Pros and Cons of Shortest Remaining Time

Answer 1

• Arrival time is the point of time at which a process enters the ready queue.
• Completion time is the point of time at which a process completes its execution on the CPU and takes exit from the system.
• Burst time is the amount of time required by a process for executing on CPU.
• Turn Around time is the total amount of time spent by a process in the system.
• Waiting time is the amount of time spent by a process waiting in the ready queue for getting the CPU.

Pros:

• Similar to that of SJF, except that if we are currently running a task, and a smaller task arrives, then we pre-empt the currently running task in order to complete the smaller task. Therefore, this scheduling algorithm will have an even higher “task throughput” rate than SJF.

Cons:

• Similar to SJF, except that now there is also context-switching overhead incurred for pre-empting a currently running task in favor of a shorter one.