L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS

2.5M views
•
May 18, 2018
by
Gate Smashers
YouTube video player
L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS

Transcript

Hello friends, Welcome to Gate Smashers The topic is scheduling algorithm in operating system So scheduling algorithm is a way or selecting a process from ready queue and put it in the CPU Means, according to the degree of multi programming, we tried to keep multiple processes in the ready queue And ready queue lies in the RAM Means we uses differe... Read More

Install to Summarize YouTube Videos and Get Transcripts

Explore YouTube Video Summarizer or Get YouTube Transcript Extractor

Read in Other Languages (beta)

English

Share This Summary 📚

Explore More Summaries from Gate Smashers 📚

What Are the Key Differences Between Datagram and Virtual Circuit Switching? thumbnail
What Are the Key Differences Between Datagram and Virtual Circuit Switching?
Gate Smashers
What Is Manchester Encoding and How Does It Work? thumbnail
What Is Manchester Encoding and How Does It Work?
Gate Smashers
What Is the Traveling Salesman Problem and How to Solve It? thumbnail
What Is the Traveling Salesman Problem and How to Solve It?
Gate Smashers
What Is Process Synchronization and Why Is It Important? thumbnail
What Is Process Synchronization and Why Is It Important?
Gate Smashers
Lec-3: Introduction to Cloud 🌧️ Computing with Real Life Examples | Key Characteristics & Benefits thumbnail
Lec-3: Introduction to Cloud 🌧️ Computing with Real Life Examples | Key Characteristics & Benefits
Gate Smashers
What Is the Difference Between Multiprogramming and Multitasking? thumbnail
What Is the Difference Between Multiprogramming and Multitasking?
Gate Smashers