Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
#27 Bakery Algorithm | Introduction to Operating Systems
Play lesson

Introduction to Operating Systems | IIT Madras - #27 Bakery Algorithm | Introduction to Operating Systems

5.0 (1)
26 learners

What you'll learn

This course includes

  • 14.3 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Full Transcript

Welcome to 'Introduction to Operating Systems' course ! This lecture delves into Peterson's Solution, a classic software-based algorithm for achieving mutual exclusion in critical sections. We'll examine the algorithm's logic, its effectiveness in preventing race conditions, and its implications in concurrent programming. 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 #synchronization #operatingsystems #criticalsection, #softwarelocking #mutualexclusion #petersonssolution

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere