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
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
Prerequisite: Round Robin Scheduling with arrival time as 0Round robin scheduling algorithm is used to schedule process fairly each job a time slot or quantum… 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
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
The most optimal scheduling algorithm is : (A) First come first serve (FCFS) (B) Shortest Job First (SJF) (C) Round Robin (RR) (D) None of… Read More
In previous post, we have discussed Set 1 of SJF i.e. non-preemptive. In this post we will discuss the preemptive version of SJF known as… Read More
Priority scheduling is one of the most common scheduling algorithms in batch systems. Each process is assigned a priority. Process with the highest priority is… Read More
Prerequisite: Banker’s Algorithm The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum… Read More
Prerequisites : Basics of FCFS Scheduling (Program for FCFS Scheduling | Set 1, Program for FCFS Scheduling | Set 2 ) Convoy Effect is phenomenon… Read More