wisemonkeys logo
FeedNotificationProfileManage Forms
FeedNotificationSearchSign in
wisemonkeys logo

Blogs

Types Of scheduling

profile
Mihir undefined
Aug 15, 2024
0 Likes
0 Discussions
102 Reads

In an operating system (OS), scheduling is a critical function that determines the order in which processes are executed. There are several types of scheduling, each tailored to optimize performance, ensure fairness, and meet the specific needs of different applications.


1. Long-Term Scheduling: This type of scheduling, also known as job scheduling, controls which processes are admitted to the system for processing. It determines which jobs (programs in the job pool) enter the ready queue, regulating the degree of multiprogramming. Long-term scheduling occurs less frequently and aims to maintain a balance between I/O-bound and CPU-bound processes to optimize resource utilization.


2. Short-Term Scheduling: Also known as CPU scheduling, this type is responsible for deciding which of the processes in the ready queue will be executed by the CPU next. The short-term scheduler, or dispatcher, makes decisions frequently, every few milliseconds. Algorithms like First-Come, First-Served (FCFS), Shortest Job Next (SJN), and Round Robin (RR) are used to allocate CPU time. The goal is to maximize CPU utilization, reduce waiting time, and ensure a responsive system.


3. Medium-Term Scheduling: This involves swapping processes in and out of memory to optimize performance and manage the degree of multiprogramming. It’s a part of the swapping mechanism where inactive processes are moved to disk to free up memory for active processes. Medium-term scheduling helps balance the load on the CPU and memory.


4. Real-Time Scheduling: Specifically designed for real-time operating systems, this scheduling type ensures that processes complete within a guaranteed time frame. Real-time scheduling is divided into hard real-time and soft real-time, with the former having strict deadlines and the latter allowing some flexibility. Algorithms like Rate Monotonic Scheduling (RMS) and Earliest Deadline First (EDF) are commonly used.


Each scheduling type serves a unique purpose, contributing to the overall efficiency and functionality of the operating system.


Comments ()


Sign in

Read Next

Firewall

Blog banner

Exploring Human Factors in Cyber Forensics Investigations.

Blog banner

Asana

Blog banner

Ethical Hacking

Blog banner

Memory Hierarchy

Blog banner

Direct Memory Access

Blog banner

"Can Lisp do Machine Learning?"

Blog banner

Severe landslides continue to cause concern in Joshimath, Uttarakhand

Blog banner

Online Games

Blog banner

Sensory Play for Toddlers: Boosting Curiosity Through Touch, Sound, and Colour

Blog banner

Difference Between Classification And Clustering

Blog banner

Deadlock and Starvation

Blog banner

Boxing

Blog banner

Beatbox

Blog banner

DIGITAL ECONOMY

Blog banner

Getting into Anime

Blog banner

Deadlocks

Blog banner

History of ITIL

Blog banner

Memory Management

Blog banner

Blockchain Transactions

Blog banner

10 Things To Do On Valentine's Day If You're Single

Blog banner

A Journey By Train

Blog banner

Install Ubuntu in Vmware

Blog banner

Amazon

Blog banner

Deadlock

Blog banner

Are Social Media Paid Campaigns Worth It?

Blog banner

Random Forests

Blog banner

Facebook marketing

Blog banner

Threads in OS

Blog banner

Trello ( management software)

Blog banner

Travel Geek ‘The last $50k in Switzerland’

Blog banner

From Procrastinator to Performer: How to Beat the Last-Minute Rush

Blog banner

Balance

Blog banner

ProofHub

Blog banner

operating system

Blog banner

ADD A SPICE TO YOUR LIFE.

Blog banner

Health and fitness

Blog banner

The Psychology of Diversity, Equity & Inclusion: How Inclusive Workplaces Boost Productivity

Blog banner

Ethical Issues in Data Science and Role of Data Science in Smart Cities

Blog banner

Data Lake

Blog banner

A Statistical Analysis of Player Performance and their Value in cricket

Blog banner

Danger assessment in GIS

Blog banner