Question: Suppose you have two processes using Peterson's Algorithm. If the two processes try to enter the critical section at the same time, how is mutual

Suppose you have two processes using Peterson's Algorithm. If the two processes try to enter the critical section at the same time, how is mutual exclusion enforced?

The flag and turn is set before checking to enter the critical section. When testing to enter the critical section only one process can "pass" the test, since turn can be set to only one value.

The turn variable can only be set to one value. So even if both flag variables are set, one of the processes will unset their flag.

When a process finish with the critical section, it will unset it's flag, and set the turn to the other processes. So

,

even if they try to enter at the same time, one process can let the other in afterwards.

When a process finishes with the critical section, it will unset it's flag. So

,

even if the processes try to enter at the same time, one process can let the other in afterwards.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag [i] = true; turn = j; while ( P ) do no-op;...

1 Introduction: The purpose of this assignment is to become more familiar with mutual exclusion. You will do this by implementing Peterson's Algorithm. You can find the algorithm in your Operating...

write a java program for the following assignment. Assignment: Use threads to implement Peterson's algorithm for mutual exclusion. Demonstrate that the algorithm works using two threads. One of the...

Assignment: Use threads to implement Peterson's algorithm for mutual exclusion. Demonstrate that the algorithm works using two threads. One of the threads should continually print "a". The other...

The new line character is utilized solely as the last person in each message. On association with the server, a client can possibly (I) question the situation with a client by sending the client's...

Briefly describe ASCII and Unicode and draw attention to any relationship between them. [3 marks] (b) Briefly explain what a Reader is in the context of reading characters from data. [3 marks] A...

Consider the following table of processes, which lists at what time (since the system starts) the processes request to enter a critical section by calling enter, and how long each process spends in a...

Problem 1 : - Multiple processes or nodes in a distributed system seek to coordinate access to a shared resource in a mutually exclusive manner. Each process requests access to the critical section...

Bob's Acme Supermarket has been in operation for many years, offering high-quality groceries, produce, and meat at reasonable prices. Accounting records are maintained on a departmental basis with...

Calculate Dividend Yield & Target Price of following stocks Company OCM Ltd JK Ltd PQR Ltd Laxmi Ltd. Share Price 325 610 1450 2250 Face Value 2 1 5 10 Dividend Current P/E 145% 900% 200% 70% 12 22...

What is the allow contribution of an individual on a campaign in 2 0 1 9 - 2 0 2 0

Create a query which includes the following fields: date, sales, department, and Manager. Set it with criterias to answer the following question. what is the name of the manager whose sale between...