CPU Scheduling Algorithms (Presentation)
CPU Scheduling Algorithms (Presentation)
Algorithms
THEORY, BRIEF INTRODUCTION &
COMPARISON OF THE ALGORITHMS
PRESENTERS:
AMAR JEET [BECS/H/F10/0117]
UZAIR AHMED [BECS/H/F10/0118]
Multi-tasking
Multiplexing
Efficiency
Quality of service
Medium-term Scheduling
o
o
Short-term scheduling
o
Scheduling Disciplines
Definition Algorithms responsible for distributing
Easy to understand
Easy to implement
Disadvantages:
remaining-time of a job/process
Pre-Emptive type: Can interrupt an already-running
process if a process with shorter burst-time arrives
Non-Preemptive type: Cannot interrupt an alreadyrunning process
Designed for maximum throughput
Disadvantages:
RR Round-Robin scheduling
The scheduler assigns a fixed time unit per process
RR Round-Robin scheduling
Advantages:
RR scheduling is fair
Provides equal amount of time to every process
Starvation does not occur
Disadvantages:
Queue algorithm
Gives preference to short and I/O-bound jobs
Separates processes into categories based on their
need for the processor, involves pre-emption
Different levels of queues are involved, like top-level,
high-level and low-level job queues
Widely used in Windows, MAC OS X, LINUX,
Solaris, NetBSD and FreeBSD
Disadvantages:
Algorithm
CPU
Overhead
Throughput
Turnaround
Time
Response
Time
FCFS/FIFO
Low
Low
High
Low
SJF/SRT
Medium
High
Medium
Medium
Round-Robin
High
Medium
Medium
High
Prioritybased
Medium
Low
High
High
MQS
High
High
Medium
Medium
QUESTIONS?
THANK YOU!