
The concurrent
Develop proof outlines for the two processes. Demonstrate that the proofs of the processes are interference-free. Then use the proof outlines and the method of exclusion of configurations in Section 2.8 to show that s, and s, cannot execute at the same time and that the program is deadlock-free. (Hint: You will need to introduce auxiliary variables to the program and proof outlines. These variables should keep track of the location of each process.) (b) What scheduling policy is required to ensure that a process delayed at its first await statement will eventually be able to proceed? Explain.
![90
2.32 Consider the following concurrent program:
int s = 1;
process
}
while (true) {
(await (s 0) 8 8-1;)
S₁;
8+1;)
}
foo [i= 1 to 2] {
=
Chapter 2 Processes and Synchronization
Assume s, is a statement list that does not modify shared variable s.
(a) Develop proof outlines for the two processes. Demonstrate that the proofs of
the processes are interference-free. Then use the proof outlines and the method
of exclusion of configurations in Section 2.8 to show that s, and s₂ cannot
execute at the same time and that the program is deadlock-free. (Hint: You will
need to introduce auxiliary variables to the program and proof outlines. These
variables should keep track of the location of each process.)
(b) What scheduling policy is required to ensure that a process delayed at its first
await statement will eventually be able to proceed? Explain.](https://content.bartleby.com/qna-images/question/1f0f6ab7-fc65-4fdb-8c11-d02a56622979/21d65a32-8748-48d4-b5fa-436cdad9aca9/ikji11k_thumbnail.png)

To prove that the concurrent program is interference-free and deadlock-free, we need to demonstrate that the processes cannot execute at the same time and that the program does not contain any circular wait conditions.
Trending nowThis is a popular solution!
Step by stepSolved in 4 steps

- The following 5 states of Evard's machines should be explained. Off in a New, Clean Configuration with Unknownarrow_forwardDescribe the boots' operation in bullet points.arrow_forwardQuestion 3 Given the following circuit, we suspect that a is stuck at 1. Which statements below are correct? W1 W2 D a d Do We need to force a to be 1 in order to test whether a is really stuck at 1. b and w5 must both be set to 0 so that e can be forced to 0 in order to test whether a is stuck at 1. d needs to be forced to be 0 so that the effect of a can be propagated to the output. e needs to be forced to be 1 so that the effect of a can be propagated to the output.arrow_forward
- I need help with my MATLAB code. I wanted to numerically integrate MRPs. When there was a singularity in MRP, my code would stop it using an event function. Now, I want to switch to the MRP shadow set and run the ode45 again with the updated initial conditions. How do I do that? clc;clear all; w0 = [0; 0; 0.3]; MRP0 = [0; 0; -0.198912367379658];tspan = [0, 100]; % Integrate the Euler equations using ode45 with an event functionoptions = odeset('RelTol', 1e-10, 'AbsTol', 1e-10, 'Events', @singularityEvent);[t, y, te, ye, ie] = ode45(@KDE_MRP, tspan, [MRP0; w0], options); % Extract the Euler parameters and angular velocitiesMRP = y(:, 1:3);w = y(:, 4:6); % plotting MRP vs timeplot(t,MRP, '-')xlabel('time (s)')ylabel('MRP')legend('MRP1', 'MRP2', 'MRP3') function [value, isterminal, direction] = singularityEvent(t, MRPw) % Event function to detect when the norm of MRP approaches 2 value = norm(MRPw(1:3)) - 1; isterminal = 1; % Stop the integration when the event is detected…arrow_forwardInstructions: Write the code of the given problems in Script File and then copy the code on the LMS assignment module directly. Also copy the output of the program. Question: Plot the following three sine curves on same figure. For the curve 1, use a linewidth of 2. For the curve 2, specify a dashed green line style with diamond markers. For the curve 3, specify a red, dash-dot line style with asterisk markers. 1. sin(x) 2. sin(x+¹) 4 T --) 4 3. sin(x-arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





