Scribd
Upload
2 views3 pages

Tech Talk CPU Scheduling Script

The Tech Talk presented by Vaibhav Yashwant Abhang covers CPU Scheduling Algorithms, emphasizing their importance in efficient process management within operating systems. Key algorithms discussed include First-Come, First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR), each with distinct advantages and disadvantages. The presentation concludes with a suggestion for an interactive demo to illustrate the scheduling processes in real-time.

Uploaded by

grsh779
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views3 pages

Tech Talk CPU Scheduling Script

The Tech Talk presented by Vaibhav Yashwant Abhang covers CPU Scheduling Algorithms, emphasizing their importance in efficient process management within operating systems. Key algorithms discussed include First-Come, First-Served (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR), each with distinct advantages and disadvantages. The presentation concludes with a suggestion for an interactive demo to illustrate the scheduling processes in real-time.

Uploaded by

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

Tech Talk Script: CPU Scheduling

Algorithms
Slide 1: Title Slide
Good [morning/afternoon], everyone. My name is Vaibhav Yashwant Abhang from
CSE-B, 2nd Year. Today, I’ll be presenting a Tech Talk on CPU Scheduling
Algorithms, a key topic in Operating Systems that ensures efficient process
management inside a computer system.

Slide 2: Module 6: CPU Scheduling


CPU Scheduling is essential in multitasking systems. When multiple processes are in
the ready queue, the scheduler decides which one runs next. A good scheduling
algorithm helps in maximizing CPU efficiency and user responsiveness.

Slide 3: Scheduling Criteria


Here are the core metrics used to evaluate scheduling algorithms:
- CPU Utilization: Keeping the CPU busy as much as possible.
- Throughput: Number of processes completed per unit time.
- Turnaround Time: Time from submission to completion.
- Waiting Time: Time a process waits in the ready queue.
- Response Time: Time from request submission to the first response.

Ideally, we aim for high CPU utilization and throughput, while keeping the rest as
low as possible.

Slide 4–5: First-Come, First-Served (FCFS) Scheduling


Let’s begin with the simplest one: FCFS, where the first process to arrive is executed
first.

Suppose we have three processes: P1 with 24ms, P2 with 3ms, and P3 with 3ms
burst times, arriving in order P1, P2, P3.

The Gantt chart shows P1 running first, which leads to high waiting times for P2 and
P3, averaging 17ms.

However, if the order was P2, P3, P1, the average waiting time drops significantly to
3ms.
So, FCFS is non-preemptive and simple but not efficient when long jobs arrive
before short ones.

Slide 6–7: Shortest Job First (SJF) Scheduling


SJF schedules the process with the shortest burst time first.

There are two variants:


- Non-preemptive: Once a process starts, it runs till completion.
- Preemptive (Shortest Remaining Time First): A new shorter job can interrupt the
current one.

In the non-preemptive example, the average waiting time is 6.75ms. In the


preemptive example, it's just 3ms.

So, SJF offers the optimal average waiting time, but it requires knowing future burst
times, which is not always possible.

Slide 8–9: Priority Scheduling


In Priority Scheduling, each process is assigned a priority number.

The CPU is assigned to the process with the highest priority (lowest number).

Like SJF, it can be preemptive or non-preemptive.

A key problem here is starvation: low-priority processes may never execute. The
solution is aging, which gradually increases the priority of waiting processes.

In our example, the average waiting time is 8.2ms.

Slide 10–11: Round Robin (RR) Scheduling


Now let’s talk about Round Robin, one of the most widely used algorithms in time-
sharing systems.

Each process gets a small time slice or time quantum (say 20ms). After its time is up,
it goes to the end of the queue.

This way, all processes get fair CPU access. If the quantum is too large, it behaves
like FCFS. If it’s too small, too much time is spent on context switching.

Though turnaround time may be higher than SJF, RR provides much better response
time, which is important for interactive systems.
Slide 12: Tech Talk Theme Slide
This concludes our look at CPU scheduling algorithms. We explored FCFS, SJF,
Priority, and Round Robin—each with its strengths and weaknesses depending on
the system's goals.

Slide 13 (Optional): Burst Time Cards / Demo Idea


To make the session interactive, I created 4 burst time cards. In a live demo, we
could simulate how each algorithm schedules the same set of processes differently
—like a real-time Gantt chart with audience volunteers.

This demo helps visualize the impact of scheduling choices.

Slide 14: Final Slide – BYTE-FEST 2K25


So, is this a good topic for a tech talk? Absolutely! CPU scheduling impacts
everything from mobile apps to cloud servers.

It's technical yet relatable, and simulations make it engaging.

Thank you for your attention, and I’m open to questions now.

You might also like