2014329620049-6.1 (28.218.81608.81609.81613.222.81848.81955)
（1）In the use of the tag and return variable, the mutual exclusion condition is guaranteed. If the two process set their identity to true, only one process will succeed, that is, the turn of the process. When another process updates its return variable, the waiting process enters its critical region (2)The ready process, through the flag, returns the variable. This algorithm does not provide strict alternation. If a process wants to enter its critical area, it can set its identity to the true, and then enter their critical area. When exiting the critical area, it can be set to the value of the other process. If the process wants to enter its critical zone again before another process, it will repeat the process: enter its critical area and turn to another process when it exits. (3)In the use of double T return variable, the sector is waiting for the blocked. Assume that the two process wants to enter the critical area of their responsibilities. They all set the value of their flag to be true; but only the turn of the thread can be executed; the other threads are in the waiting state. If the sector is not blocked, when the first process is repeated, "entry exit" is the process of its critical region. Dekker algorithm in a process to set a value to another process, so as to ensure that the next process to enter its critical region.
group status
👤 group joined: 1 ⏳ group pending: 0 🚫 group blocked: 0
> Computer and Education > courses > university courses > undergraduate courses > Operating System > CLASS (2016-2017-1)-62903-06102-1 > 2014329620049-6.1 >
(28.218.81608.81609.81613.222.81848.81955)