We help IT Professionals succeed at work.
Get Started

Why is Peterson's algorithm better at mutual exclusion that its predecessors?

shampouya
shampouya asked
on
291 Views
Last Modified: 2015-03-24
In very basic terms, what is the problem of mutual exclusion and how does Peterson’s Algorithm work? I only know that it sets variables equal to 0 or 1 as a way to signal which process can enter the critical region. What is the critical region? Why does Peterson’s Algorithm work better than the earlier attempts at mutual exclusion?
Comment
Watch Question
CERTIFIED EXPERT
Most Valuable Expert 2014
Top Expert 2015
Commented:
This problem has been solved!
Unlock 1 Answer and 1 Comment.
See Answer
Why Experts Exchange?

Experts Exchange always has the answer, or at the least points me in the correct direction! It is like having another employee that is extremely experienced.

Jim Murphy
Programmer at Smart IT Solutions

When asked, what has been your best career decision?

Deciding to stick with EE.

Mohamed Asif
Technical Department Head

Being involved with EE helped me to grow personally and professionally.

Carl Webster
CTP, Sr Infrastructure Consultant
Ask ANY Question

Connect with Certified Experts to gain insight and support on specific technology challenges including:

  • Troubleshooting
  • Research
  • Professional Opinions
Did You Know?

We've partnered with two important charities to provide clean water and computer science education to those who need it most. READ MORE