answersLogoWhite

0

Peterson's solution:- (AKA Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two processes to share a single-use resource without conflict, using only shared memory for communication. It was formulated by Gary L. Peterson in 1981.While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two.

Mutual exclusionP0 and P1 can never be in the critical section at the same time: If P0 is in its critical section, then either flag is false (meaning P1 has left its critical section) or turn is 0 (meaning P1 is just now trying to enter the critical section, but graciously waiting). In both cases, P1 cannot be in critical section when P0 is in critical section.
User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
MaxineMaxine
I respect you enough to keep it real.
Chat with Maxine
ReneRene
Change my mind. I dare you.
Chat with Rene

Add your answer:

Earn +20 pts
Q: What is Peterson's solution in operating system?
Write your answer...
Submit
Still have questions?
magnify glass
imp