TAILIEUCHUNG - Lecture Operating systems: Lesson 24 - Dr. Syed Mansoor Sarwar

Lecture Operating systems: Lesson 24 - Dr. Syed Mansoor Sarwar. The main topics covered in this lesson include: types of semaphores, counting semaphores, classical synchronization problems, bounded buffer problem, readers and writers problem, dining philosophers problem, . | Operating Systems Lecture 24 Syed Mansoor Sarwar Agenda for Today Review of previous lecture Counting semaphores Classical synchronization problems Bounded buffer problem Readers and writers problem Dining philosophers problem Recap of lecture 28 April 2022 Copyright Virtual University of Pakistan Review of Lecture 23 Busy waiting New definition of semaphore Process synchronization Deadlock and starvation Binary and counting semaphores 28 April 2022 Copyright Virtual University of Pakistan Types of Semaphores Counting semaphore integer value can range over an unrestricted integer domain. Binary semaphore integer value cannot be gt 1 can be simpler to implement. 28 April 2022 Copyright Virtual University of Pakistan Implementing a Counting Semaphore Data structures binary-semaphore S1 S2 int C Initialization S1 1 S2 0 C initial value of semaphore S 28 April 2022 Copyright Virtual University of Pakistan Implementing a Counting Semaphore wait S wait S1 C- if C lt 0 signal S1 wait S2 28 April 2022 signal S1 Copyright Virtual University of Pakistan Implementing a Counting Semaphore signal S wait S1 C if C Classical Problems of Synchronization Bounded-Buffer Problem Readers and Writers Problem Dining Philosophers Problem 28 April 2022 Copyright Virtual University of Pakistan Bounded Buffer Problem Empty Pool Producer Consumer Full Pool 28 April 2022 Copyright Virtual University of Pakistan Bounded-Buffer Problem Shared data semaphore full empty mutex Initialization full 0 empty n mutex 1 28 April 2022 Copyright Virtual University of Pakistan Producer Process do produce an item in nextp wait empty wait mutex add nextp to buffer signal mutex signal full while 1 CopyrightPakistan 28 April 2022 Virtual University of Consumer Process do wait full wait mutex remove an item from buffer to nextc signal mutex signal empty consume the item in nextc while 28 April 2022 1 CopyrightPakistan Virtual University of Readers and Writers Problem 28 April 2022 Copyright Virtual University

• Hệ điều hành
• Lecture Operating systems
• Bài giảng Hệ điều hành
• Operating systems
• Counting semaphores
• Classical synchronization problems
• Bounded buffer problem
• Lecture Advanced Operating Systems
• Advanced Operating Systems
• Bài giảng Hệ điều hành nâng cao
• Server operating systems
• Multiprocessor operating systems
• PC operating systems
• Main frame operating systems
• Real time operating systems
• Structure of operating systems
• Distributed operating systems
• Memory management
• Embedded systems
• Modern operating systems
• Evolution of operating systems
• Memory protection
• File systems
• Characteristics of real time operating systems
• Real time scheduling
• Hệ điều hành
• Distributed systems
• Network operating systems
• Resource management
• User programs
• Computing environments
• Monolithic structure
• Implementing processes
• Process synchronization
• Scheduling policies
• Deadlock detection
• Handling deadlocks
• Message passing
• Implementing message passing
• Virtual memory
• Virtual memory manager
• File operations
• Distributed control algorithms
• Election algorithms
• Distributed system security
• Message security
• Networking essentials plus
• Lecture Networking essentials plus
• Novell operating systems
• Microsoft network operating systems
• Operating system
• Operating system concept
• Operating systems design
• Operating systems capabilities
• Network operating system
• Operating system structures
• Operating system design
• Operating system services
• Internalsand design principles
• Computer system
• Operating system objectives