Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Arrays6.5K+ articles

Difference Between3.6K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Sorting1.8K+ articles

GATE CS1.4K+ articles

Operating Systems1.2K+ articles

Operating Systems-CPU Scheduling48+ articles

cpu-scheduling

37 posts

Find the time taken finish Processing of given processes

Last Updated: 29 June 2022

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[] denotes time taken by a proces...read more

Operating Systems

Scheduling in Greedy Algorithms

Last Updated: 03 November 2022

In this article, we will discuss various scheduling algorithms for Greedy Algorithms. Many scheduling problems can be solved using greedy algorithms.Problem statement: Giv...read more

article_image

Analysis of Algorithms

Advanced Data Structure

Operating Systems Questions

Operating Systems-CPU Scheduling

Find the order of execution of given N processes in Round Robin Scheduling

Last Updated: 02 February 2023

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 process arrive at ti...read more

Operating Systems

frequency-counting

Calculate server loads using Round Robin Scheduling

Last Updated: 17 March 2023

Given M servers that handle multiple requests having infinite computational capability and arrays arrivalTime[] and processTime[] of size N denoting the arrival time and l...read more

Operating Systems

Operating Systems-CPU Scheduling

Traps and System Calls in Operating System (OS)

Last Updated: 04 April 2023

Traps and system calls are two mechanisms used by an operating system (OS) to perform privileged operations and interact with user-level programs. Here is an overview of e...read more

article_image

Operating Systems

Operating Systems-CPU Scheduling

Difference between Multi Level Queue (MLQ) Scheduling and Round Robin (RR) algorithms

Last Updated: 10 May 2025

Queue Schedulingrefers to the process of managing and organizing tasks (or processes) that need to be executed by a system. In an operating system, tasks are often placed ...read more

article_image

Operating Systems

Difference Between

Difference between FCFS and C-LOOK disk scheduling algorithm

Last Updated: 15 September 2022

1. FCFS Disk Scheduling AlgorithmFCFS stands for First Come First Serve, this algorithm entertains the task in the order they arrived in the disk queue. It is the simplest...read more

article_image

Operating Systems

Operating Systems-CPU Scheduling

Difference Between

List scheduling in Operating System

Last Updated: 28 February 2023

Prerequisite - CPU Scheduling List Scheduling also known as Priority List Based Scheduling is a scheduling technique in which an ordered list of processes are made by assi...read more

article_image

Operating Systems

Operating Systems-CPU Scheduling

CPU Scheduling in Operating Systems using priority queue with gantt chart

Last Updated: 25 June 2024

Prerequisite: CPU Scheduling in Operating SystemsDifferent Scheduling Algorithms:First Come First Serve CPU Scheduling: Simplest scheduling algorithm that schedules accord...read more

article_image

Analysis of Algorithms

Dynamic Programming

Operating Systems

Data Structures

Operating Systems-CPU Scheduling

Difference Between Preemptive and Non-Preemptive CPU Scheduling Algorithms

Last Updated: 04 September 2024

Preemptive scheduling permits a high-priority task to interrupt a running process, When a process transitions from the running to the ready or from the waiting to the read...read more

article_image

Operating Systems

Difference Between

Advantages and Disadvantages of various CPU scheduling algorithms

Last Updated: 28 December 2024

CPU Scheduling involves many different scheduling algorithms which have their Advantages and Disadvantages.1. First Come First Serve (FCFS):Advantages: It is simple and ea...read more

Operating Systems

Shortest Job First (or SJF) CPU Scheduling Non-preemptive algorithm using Segment Tree

Last Updated: 17 January 2024

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. SJN is a non-preem...read more

article_image

Operating Systems

Operating Systems-CPU Scheduling

Earliest Deadline First (EDF) CPU scheduling algorithm

Last Updated: 05 April 2024

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 schedulin...read more

article_image

Operating Systems

Operating Systems-CPU Scheduling

Difference between Long-Term and Medium-Term Scheduler

Last Updated: 29 March 2023

Prerequisite - Process SchedulersLong-Term Scheduler:Long-term schedulers are called job schedulers. The long-term scheduler controls the programs that are selected within...read more

article_image

Operating Systems

Difference Between

Clairvoyant Shortest Job first (SJF)

Last Updated: 21 March 2023

In this article, we discuss Clairvoyant SJF. It is a theoretical concept in which the algorithm looks in the future and waits for the shortest process to arrive, this resu...read more

Operating Systems

Operating Systems-CPU Scheduling