p_v操作（P_v operation）.docVIP

p_v操作（P_v operation） The meaning of PV operations: PV operations consist of the P operation primitive and the V operation primitive (primitive is an interruptible process), and operate on semaphores, as defined below: P (S): reduce the value of semaphore S by 1, that is, S=S-1; If S=0, the process continues; otherwise, the process is set as a wait state and is queued for waiting. V (S): add the value of semaphore S by 1, that is, S=S+1; If S0, the process continues; otherwise, the first queue in the queue to wait for the semaphore is released. The meaning of PV operations: we use semaphores and PV operations to achieve synchronization and mutual exclusion of processes. PV operation belongs to low-level communication of process. Semaphore: Struct semaphore { Int value; / / only and must be initialized once, the initial value of non negative PCBtype* wait_queue; / / this signal on the blocking process (pointing to the queue waiting for the semaphore next process) }S; / / semaphore instance is S The value of the semaphore is related to the use of the corresponding resource. Usage method： * P V operations occur in pairs, processing mutex occurs in the same process, processing synchronization occurs in different processes. * synchronization P is preceded by mutually exclusive P calls, and V is sequential independent. Using semaphore and PV operations to achieve a common model of process mutex is: Process P1 process P2...... Process Pn .................. P (S); P (S); P (S); Critical region; critical region; critical region; V (S); V (S); V (S); ........................ Among them, semaphore S is used mutually exclusive, initial value is 1. Process synchronization using semaphore and PV operation PV operations are one of the typical synchronization mechanisms. A message is associated with a message. When the semaphore value is 0, the expected message has not yet been generated; when the semaphore value is not 0, the desired message already exists. Using PV operations to a