Scheduling Algorithms Simulator!

In an operating system, CPU scheduling is a process of determining which process will own CPU for execution while another process is on hold.

Find Out More

Brief Explanation

The main task of CPU scheduling is to make sure that whenever the CPU remains idle, the OS at least select one of the processes available in the ready queue for execution. The selection process will be carried out by the CPU scheduler. It selects one of the processes in memory that are ready for execution..

View Demo!

VARIOUS SCHEDULING ALGORITHMS

Algorithms

FCFS

This is the easiest and most simple CPU scheduling algorithm.

More Info Demo

SJF

As the name suggests,the process with the shortest execution time should be selected for execution next.

More Info Demo

LJF

As the name suggests this algorithm is based upon the fact that the process with the largest burst time is processed first. .

More Info Demo

PRIORITY NON-PREEMPTIVE

As the name suggests,Each process is assigned a priority. Process with highest priority is to be executed first.

More Info Demo

PRIORITY PREEMPTIVE

As the name suggests,Each process is assigned a priority. Process with highest priority in the queue is to be executed first.

More Info Demo

ROUND-ROBIN

Round robin is the oldest, simplest scheduling algorithm.

More Info Demo

LRTF

In this scheduling algorithm, we find the process with the maximum remaining time and then process it.

More Info Demo

SRTF

In this scheduling algorithm,The process which has the least processing time remaining is executed first.

More Info Demo