Computer Science, asked by shivthrock2884, 1 year ago

Describre using compare and swap for mutual exclusion and bounded wait

Answers

Answered by Anonymous
0

It controls access to the shared resource by controlling each mutual execution of that part of its program where the resource would be used. A successful solution to this problem must have at least these two properties: It must implement mutual exclusion: only one process can be in the critical section at a time.

Answered by AfreenMohammedi
0

Answer:

processes to ensure mutual exclusion for one resource (say one variable or ... Since condition is true, it keeps busy waiting until it loses the processor ... Swap Solution to the Critical Section Problem.

Similar questions