TAILIEUCHUNG - Lecture Operating system principles - Chapter 6: Concurrency: Deadlock and starvation

This chapter examines two problems that plague all efforts to support concurrent processing: deadlock and starvation. We begin with a discussion of the underlying principles of deadlock and the related problem of starvation. Then we examine the three common approaches to dealing with deadlock: prevention, detection, and avoidance. | Chapter 6 Concurrency: Deadlock and Starvation Principals of Deadlock Deadlock Prevention Deadlock Avoidance Deadlock Detection Dining Philosophers Problem Deadlock A set of processes is deadlocked when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set Typically involves processes competing for the same set of resources The event is typically the freeing up of some requested resources No efficient solution Potential Deadlock I need quad A and B I need quad B and C I need quad C and D I need quad D and A The necessary resources are available for any of the cars to proceed Actual Deadlock HALT until B is free HALT until C is free HALT until D is free HALT until A is free Two Processes P and Q Consider two processes P and Q in a uniprocessor system. Each needs exclusive access to a resource A and B for a period of time. Joint Progress Diagram of Deadlock Deadlock is only inevitable if the joint .

• Hệ điều hành
• Operating system
• Lecture Operating system principles
• Hệ điều hành
• Computer system
• Deadlock prevention
• Deadlock avoidance
• Operating system concepts
• Lecture Operating system concepts
• Operating system services
• Operating system structures
• Operating system design
• Operating system structure
• Computer system organization
• Operating System Debugging
• Operating System Generation
• Types of System Calls
• Modern operating systems
• Evolution of operating systems
• Computer system structures
• File system interface
• File system implementation
• Computer system architecture
• The Linux system