Question

A system n processes, and with a non preemptive scheduler. What is the total number of scheduling possible?

Answer 1

FCFS is a non-preemptive scheduling algorithm. Note:First come first serve suffers from convoy effect. Shortest Job First (SJF): Process which have the shortest burst time are scheduled first.If two processes have the same bust time then FCFS is used to break the tie.

Answer 2

Answer:

The total number of scheduling possible is two.

Explanation:

There are two types of process scheduling. They are preemptive scheduling and non-preemptive scheduling.

Process scheduling is operated through the scheduler. The scheduler chooses the process from the queue. It then loads it in the memory of the CPU for execution. Depending on the method of scheduling there are two types.

In ‘preemptive scheduling’ the CPU is confined to the processes for a limited time period only. In ‘non-preemptive scheduling’ the CPU is confined to the process till it completely terminates or it switches to a waiting state.