Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
Last updated: Feb 6, 2022


Operating System allocates priorities to jobs. Deciding which job to run next is the job of the scheduler. The scheduler must maximize throughout try to process as many jobs as possible in as little time as possible. Balance resource use and avoid pushing low-priority jobs to the back of the queue forever.
Introduction of Process Management EASY
This blog will discuss the topic of Introduction to Process Management, which includes Process attributes, states, operations, management, device and processor management.
Scheduling in Operating System EASY
Process Scheduling in Operating System involves managing tasks, determining their order for execution, optimizing resource utilization for efficiency. Read on to learn more!
First In First Out (FIFO) Algorithm in OS
This article will cover the implementation, advantages, and applications of FIFO in OS. We will also see the FIFO page replacement algorithm.
Scheduling Algorithms in Operating Systems EASY
This blog discusses the scheduling algorithms in operating systems and highlights the important terminologies. It also lists the various scheduling algorithms used to schedule processes in the OS.
How Is Shortest Job First Scheduling Performed In Operating Systems? MEDIUM
This article discusses the shortest job first scheduling, Shortest-Job-First Preemptive Scheduling, Shortest-Job-First Non-Preemptive Scheduling, and advantages and disadvantages of shortest job first.
Attributes of a Process
This article will go through the Operating System that uses the process attributes to generate the process control block (PCB).
Look Disk Scheduling EASY
LOOK disk scheduling is an improved version of SCAN Disk Scheduling Algorithm. It is like a smart way to organize computer tasks
Process Queues
This blog will introduce the Process Queues, their types and working and their implementation in detail.
Author coldz
States of a Process
In this brief article, we will understand all the states a process undergoes between the operation of creating and terminating a process.
Process Scheduler
This article incorporates the process schedulers along with a detailed explanation of its three types of schedulers.
CPU Scheduling
In this article, we will study some concepts of CPU scheduling and several CPU scheduling algorithms along with its types.
Non-Preemptive Priority Based Scheduling
This article deals with the topic Non-Preemptive priority based scheduling algorithm, explains how it works, and discusses its advantages and disadvantages.
Difference Between Preemptive and Non-Preemptive Scheduling MEDIUM
In this article, we will cover the major differences between preemptive and non-preemptive scheduling with its advantages and disadvantages.
Measure the Time Spent in Context Switch
In this blog, we will learn about context switch, context switch steps, and how to calculate context switch time.
Difference between Dispatcher and Scheduler
This article is about the difference between dispatcher and scheduler, types of scheduler illustrated with examples.
FCFS Scheduling Program in C MEDIUM
Implement First-Come, First-Served (FCFS) scheduling in C to execute processes in the order they arrive for simplicity.
Shortest Remaining Time First Scheduling Algorithm EASY
Shortest Remaining Time First (SRTF) Algorithm is the preemptive variant/version of the SJF scheduling algorithm.
Program for First Come First Serve Scheduling MEDIUM
We will be writing a program for FCFS, a scheduling algorithm that automatically executes queued requests in an operating system.
Convoy Effect in Operating System EASY
The Convoy Effect is a phenomenon in which the entire Operating System slows down owing to a few slower processes in the system.
What is Belady's Anomaly in Operating System MEDIUM
Bélády’s anomaly occurs when adding more page frames to memory leads to more page faults for a specific access pattern.
Shortest Job First(Non-preemptive) MEDIUM
This article will cover the in depth analysis of shortest job first (SJF) Non preemptive CPU scheduling. We will also see the code for SJF implementation and an example on it.
Shortest Job First (SJF) CPU Scheduling Algorithm EASY
Shortest Job First (SJF), also known as Shortest job next (SJN) is a scheduling policy that prioritises the execution of the process
Round Robin Scheduling
This article covers the Round Robin scheduling algorithm followed by several examples and use-cases in detail.
Author Alisha
Round Robin Scheduling | Part-2
This article covers the algorithm and Implementation part of the Round Robin scheduling algorithm in C++ language.
Round Robin CPU Scheduling Algorithm MEDIUM
You open your system in the morning, you open your mailbox, text someone on chat, join your meetings, and have you ever wondered that all this happens at the same time, within some seconds. Let’s examine how the algorithm works. The name of Round Robin Scheduling algorithm comes from the old principle round robin, where the algorithm is designed to get the equal share, maybe time or memory.
HRRN Scheduling
This article will discuss one of the types of CPU scheduling i.e. HRRN Scheduling, along with its working and example.
Multilevel Queue Scheduling MEDIUM
In this article, we will learn about the multilevel queue scheduling algorithm, its working with the help of an example in detail.
Multilevel Feedback Queue Scheduling (MLFQ) MEDIUM
Multilevel Feedback Queue Scheduling (MLFQ) is an advanced CPU scheduling method based on the Multilevel Queue (MLQ) approach.
Lottery Process Scheduling
This blog will discuss ‘Lottery Process Scheduling in Operating System’ with the help of an example in detail.
Multiple Processors Scheduling in Operating System EASY
Multiprocessor Scheduling involves multiple CPUs, due to which Load sharing is possible. Load Sharing is the balancing of load between numerous processors.
Weighted-Job Scheduling MEDIUM
This article will discuss the variations of the job scheduling problem in data structures and algorithms, followed by a comprehensive discussion of various approaches from brute force to the most optimal.
Race Condition in Operating System MEDIUM
A race condition is a problem that occurs in an operating system (OS) where two or more processes or threads are executing concurrently.