Introduction to Operating Systems | IIT Madras - #20 Priority Based Scheduling Algorithms | Introduction to Operating Systems

Welcome to 'Introduction to Operating Systems' course ! This lecture introduces priority-based scheduling algorithms, emphasizing their ability to prioritize critical processes over less critical ones. The lecture begins with a motivating example illustrating the need for priority scheduling in scenarios where certain processes require faster response times. It explains how priority scheduling assigns priority numbers to processes, with lower numbers indicating higher priority. The lecture discusses potential issues with priority scheduling, such as starvation of low-priority processes, and proposes solutions like aging, where process priority increases over time. It also explains the concepts of static and dynamic priority, highlighting the advantages and limitations of each. Finally, the lecture delves into multilevel feedback queue scheduling, a dynamic priority scheduling algorithm that adjusts process priority based on their CPU and I/O behavior. NPTEL Courses permit certifications that can be used for Course Credits in Indian Universities as per the UGC and AICTE notifications. To understand various certification options for this course, please visit https://nptel.ac.in/courses/106106144 #PriorityScheduling #Starvation #Aging #MultilevelFeedbackQueue