3.

a.

The CPU scheduling algorithm determines the performance of a multiprocessor system and a time-
sharing system. Round Robin scheduling (RR), Shortest job first (SJF), Preemptive variant of SJF (SRTF),
and First Come First Serve (FCFS) are some of the well-known efficient CPU scheduling methods. Among
all the known CPU scheduling methods, the Round Robin scheduling algorithm is currently regarded the
most efficient process scheduling algorithm. However, in RR, the shortest jobs must wait longer, while in
SRTF, the longer process behaves as a suspended process because the shorter tasks continue to run.
This study offers ESRR (Efficient Shortest Remaining Time Round Robin), a new scheduling process
technique that combines two preemptive versions of existing scheduling algorithms, RR and SRTF.

b.

The simplest and non-preemptive scheduling algorithm is First Come First Serve (FCFS). The process is
assigned to the CPU in the order in which it arrives in First Come First Serve (FCFS). The FCFS scheduling
technique is implemented using a queue data structure. When the CPU becomes available, the process
at the top of the ready queue is assigned to it. The currently executing process is then removed from the
queue. When a new process is added to the ready queue, it is moved to the back of the queue.

The Round Robin (RR) Scheduling Algorithm is a time-sharing system architecture. Preemptive
scheduling is the name of this algorithm. A short unit of time called a time quantum or time slice is
provided to each job in the Round Robin Scheduling Algorithm. In cyclic sequence, CPU is allocated to
each work for the duration equal to the time quantum.

c.

The more times a process is planned, the longer it will take to complete. As a result, increasing the time
Quantum will increase the number of times a procedure is scheduled. As a result, the completion time
will lengthen.

d.

For the same set of operations, different CPU scheduling techniques provide varying turnaround times.
This is due to the fact that when the CPU scheduling method is changed, the waiting time of processes
varies.

e.

Yes, because in a round-robin, if a process is completed inside the specified time frame, it is preempted,
and the remaining Processes are performed accordingly. Round robin is a CPU scheduling strategy that
avoids CPU depletion by distributing CPU resources evenly among all processes.

Arkay. (2021, December 5). Difference between FCFS, round robin, SJF and SRT scheduling. H.
Retrieved December 20, 2021, from https://h-educate.in/difference-between-fcfs-round-
robin-sjf-and-srt-scheduling/
Comparison of scheduling algorithms. Studytonight.com. (n.d.). Retrieved December 20, 2021,
from https://www.studytonight.com/operating-system/comparision-scheduling-algorithms