Shortest Job First Algorithm - Priority Scheduling - Round Robin CPU Scheduling
CodeHelp - by Babbar via YouTube
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Dive into an in-depth exploration of CPU scheduling algorithms in this 45-minute video lecture. Learn about non-preemptive and preemptive shortest job first scheduling, priority scheduling techniques, and the round robin algorithm. Understand the concept of indefinite waiting in priority scheduling and how the ageing technique addresses this issue. Access comprehensive notes, slides, and additional resources to enhance your learning experience. Engage with timestamps for easy navigation through specific topics, and connect with the instructors for further discussions and clarifications.
Syllabus
- Introduction
- Promo
- Non-preemptive shortest job first scheduling
- preemptive shortest job first scheduling
- Non-preemptive priority scheduling
- preemptive priority scheduling
- Indefinite waiting in Priority scheduling
- Ageing technique
- Round robin scheduling
- Summary notes
Taught by
CodeHelp - by Babbar