Showing posts with label Scheduling. Show all posts
Showing posts with label Scheduling. Show all posts

## Priority Scheduling:

In operating systems, tasks that are queued to be processed go through different scheduling algorithms in different operating systems. Priority Scheduling is one of them.
Priority scheduling is like shortest job first except that the next job to process is selected not by the amount of time it will take, but by the priority of the job. So in this priority scheduling each job has a priority value associated with it. The task with shortest priority value gets preferred.

## Round Robin (RR):

In operating systems, tasks that are queued to be processed go through different scheduling algorithms in different operating systems. Round Robing or RR is one of them.

### Explain and Solve : Round Robin (RR) CPU Scheduling Algorithm in C++ with Explanation

If you haven't read/tried the earlier/other problems then click the links follow:

## Round Robin CPU Scheduling Algorithm in C++ with Explanation:

This method is quite same as the FCFS but the difference is the in this case the processor will not process the whole job (process) at a time. Instead, it will complete an amount of job (quantum) at a turn and then will go to the next process and so on. When all job has got a turn, it will again start from the first job and work for a quantum of time/cycle on each job and proceed. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time 0 1 3 1 2 2 2 3 1

Quantum = 2 Second

### Explain and Solve : Priority Scheduling CPU Scheduling Algorithm in C++ with Explanation

If you haven't read/tried the earlier problems then click the links follow:

## Priority Scheduling CPU Scheduling Algorithm in C++ with Explanation:

This method is quite same as the SJF but the difference is that instead of choosing the next process to work on by the shortest burst time, CPU chooses the next process by the shortest priority value. Here, all the processes are given a priority value. The process with the shortest (The most shortest is 1) priority will be worked on first and so on. Now consider a CPU and also consider a list in which the processes are listed as follows,

 Arrival Process Burst Time Priority 0 1 3 2 1 2 2 1 2 3 1 3

### Preemptive Shortest Job First (SJF) CPU Scheduling Algorithm in C++ with Explanation

If you haven't read/tried the earlier problems then click the links follow:

## Preemptive Shortest Job First (SJF) CPU Scheduling Algorithm in C++ with Explanation:

Preemptive Shortest Job First (SJF) is a CPU scheduling algorithm in which the CPU, at any given time, looks for the job with the shortest burst time among the jobs in hand and starts processing it. In SJF the processor will not just pick the job that arrived first, rather will compare them based on their required CPU time and will pick the one which requires lowest amount of time.

### Explain and Solve : First Come First Served (FCFS) CPU Scheduling Algorithm in C++ with Explanation

If you haven't read/tried the earlier problems then click the links follow:

## First Come First Served (FCFS) CPU Scheduling Algorithm in C++ with Explanation:

CPU gets a lot of processes to handle. The problem is shortening the waiting time for a process to reach CPU and get processed. Now consider a CPU and also consider a list in which the processes are listed as follows,
 Arrival Process Burst Time 0 1 3 1 2 2 2 3 1

Here, Arrival is the time when the process has arrived the list, Process Number is used instead of the process name, and Burst Time is the amount of time required by the process from CPU. Well, as the unit of time you can take anything like nano-second, second, minute etc whatever. We consider it as second.