Skip to content

Tag Archives: cpu-scheduling

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… 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
Shortest Remaining Time First (SRTF) is the preemptive version of Shortest Job Next (SJN) algorithm, where the processor is allocated to the job closest to… Read More
Prerequisite: Round Robin Scheduling with arrival time as 0 A round-robin scheduling algorithm is used to schedule the process fairly for each job a time… Read More
Implementing priority CPU scheduling. In this problem, we are using Min Heap as the data structure for implementing priority scheduling. In this problem smaller numbers… Read More
Prerequisite – Program for Round Robin scheduling  In the traditional Round Robin scheduling algorithm, all processes were treated equally for processing. The objective of the… Read More
We are given n-processes with their completion times in form of an array. We need to find the time instant when a given process p… Read More