'Flag 1 turn 1' diaporamas de présentation

Chapter 6: Process Synchronization

1.27k views • 102 slides

Solution to Race Condition: Mutual Exclusion and Synchronization

Solution to Race Condition: Mutual Exclusion and Synchronization. Problems with concurrent execution. Concurrent processes (or threads) often need to share data (maintained either in shared memory or files) and resources

966 views • 77 slides

Background

Background. Concurrent access to shared data may result in data inconsistency Maintaining data consistency requires mechanisms to ensure the orderly execution of cooperating processes Recall Producer/Consumer problem in Chapter 4.

601 views • 40 slides

Concurrent Processes

Concurrent Processes. x. P0. P1. 1. Wait until x has a value. 1. Wait until x is able to be set. 2. Use the value. 2. Produce a value. 3. Change the value to indicate used. 3. Set x to the value. Concurrency. Cooperating Processes.

263 views • 26 slides

Process Synchronization Continued

Process Synchronization Continued. 7.2 Critical-Section Problem 7.3 Synchronization Hardware 7.4 Semaphores. Critical section. When a process executes code that manipulates shared data (or resource), we say that the process is in a critical section (CS) for that resource. repeat

267 views • 25 slides

Process Synchronization Continued

Process Synchronization Continued. 7.2 The Critical-Section Problem. Critical section. That part of the program where shared resources are accessed

319 views • 21 slides