Scribd
Upload
4 views12 pages

Sheduling and Load Balancing

Scheduling and load balancing are essential for efficient task management in computer systems, ensuring optimal resource use, speed, and fairness. Various scheduling types include CPU, job, and I/O scheduling, with algorithms like First Come First Serve, Round Robin, Shortest Job Next, and Priority Scheduling. While scheduling improves multitasking and throughput, it can also introduce complexity and context switching issues.

Uploaded by

Ehsan Aslam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views12 pages

Sheduling and Load Balancing

Scheduling and load balancing are essential for efficient task management in computer systems, ensuring optimal resource use, speed, and fairness. Various scheduling types include CPU, job, and I/O scheduling, with algorithms like First Come First Serve, Round Robin, Shortest Job Next, and Priority Scheduling. While scheduling improves multitasking and throughput, it can also introduce complexity and context switching issues.

Uploaded by

Ehsan Aslam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Topic

Name:
Scheduling and load balancing
Scheduling and load
balancing

• Scheduling and load balancing are two


important concepts used in computer
systems and networks.
• Scheduling
• Scheduling means managing tasks or
processes so that they can be executed
efficiently. The purpose of scheduling is
to use system resources in the most
effective way.
Why is scheduling
important?
 Efficient Use of Work
Scheduling ensures that every part of a computer or any
system
works well.
 Speed
When we schedule work properly, things get done faster,
and
the system stays quick.
 Fairness
It makes sure that all work gets its fair share of time, so
nothing
waits too long.
 Priority Tasks First
Some tasks are more important, and scheduling helps us
do
them first.
Types of Scheduling

CPU Job I/O


Scheduling Scheduling Scheduling
CPU Scheduling
CPU scheduling means assigning tasks to the
CPU and deciding which process or thread will
use the CPU, when, and for how long. The goal is
to increase CPU usage and improve response
time. Some common algorithms used for this are:
Job Scheduling
The purpose of job scheduling is to manage
jobs in the system. When a job enters the
system, the job scheduler decides when it
should be executed. This process moves jobs
from the ready state to the running state. There
are a few types of job scheduling:
I/O Scheduling

I/O scheduling means how to manage input/output


devices.
Scheduling Algorithms

FIRST
PRIORITY
COME ROUND SHORTEST
SCHEDULIN
FIRST ROBIN JOB NEXT
G
SERVE
 First Come First Serve (FCFS): Tasks are
processed in the order they arrive. The first task

Scheduli that arrives is the first one to be completed, and


so on.
 Round Robin (RR): Each task is given a fixed

ng amount of time to run (called a time slice).


When a task’s time is up, it’s moved to the back
of the line, and the next task gets its turn. This

Algorith continues in a circular manner.


 Shortest Job Next (SJN): The task with the
shortest execution time is given priority and

ms completed first. This helps minimize waiting


time for short tasks.
 Priority Scheduling: Each task is assigned a
priority level. Tasks with higher priority are
processed before those with lower priority,
regardless of when they arrive.
Advantages of
Scheduling
 Improves multitasking: Scheduling
allows multiple tasks to run at once,
making the system more efficient in
handling multiple operations
simultaneously.
 Maximizes throughput: It
increases the number of tasks
completed in a given time, improving
the system's overall performance.
Disadvantages

Context switching: Not ideal for all


Complexity:
When the system tasks: Some types of
Scheduling can be
switches between tasks tasks (like real-time
complex to manage,
too often, it can lead to tasks) may not benefit
especially in systems
extra processing time, from general scheduling
with many tasks and
which slows down the methods and need
resources.
overall performance. special handling.
THANKS

You might also like