Skip to content

Tag Archives: cpu-scheduling

Preemptive Priority CPU Scheduling Algorithm is a pre-emptive method of CPU scheduling algorithm that works based on the priority of a process. In this algorithm,… Read More
Apple Silicon is basically a set of separate processors which are developed by Apple to be used in their laptops so that they become more… Read More
Given N processes and two arrays, arr1[] and arr2[] of size N each. arr1[] contains time spent by any process in critical section and arr2[]… Read More
In this article, we will discuss various scheduling algorithms for Greedy Algorithms. Many scheduling problems can be solved using greedy algorithms. Problem statement: Given N… Read More
Given an array arr[] representing burst time of N processes scheduled using the Round Robin Algorithm with given quantum time Q. Assuming that all the… Read More
Given M servers that handle multiple requests having infinite computational capability and arrays arrivalTime[] and processTime[] of size N denoting the arrival time and load… Read More
On the off chance that Operating System (OS) is secured, how does program request administrations from OS? Client programs can’t call capacities inside working framework’s memory,… Read More
1. Multi Level Queue Scheduling (MLQ) : It is quite difficult to have just one queue and schedule all the processes. This is where multi-level queue… Read More
1. FCFS Disk Scheduling Algorithm  FCFS stands for First Come First Serve, this algorithm entertains the task in the order they arrived in the disk… Read More
Prerequisite: CPU Scheduling in Operating Systems Different Scheduling Algorithms: First Come First Serve CPU Scheduling: Simplest scheduling algorithm that schedules according to arrival times of… Read More
In CPU Scheduling, we have two types of scheduling, Let’s have a look at them:  Preemptive Scheduling: In this, a scheduler may preempt a low-priority… Read More
CPU Scheduling involves many different scheduling algorithms which have their Advantages and Disadvantages.  1. First Come First Serve (FCFS):  Advantages: It is simple and easy… Read More
Shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next.… Read More
Earliest Deadline First (EDF) is an optimal dynamic priority scheduling algorithm used in real-time systems. It can be used for both static and dynamic real-time… Read More
In this article, we discuss about Clairvoyant SJF. It is a theoretical concept in which the algorithm looks in the future and waits for the… Read More

Start Your Coding Journey Now!