Question: 2- (10 points) Consider the following program: P1: { P2: shared int x; x-10; while (1)[ shared intx; x 10 while (1) X-x- 1; x=x+1;


2- (10 points) Consider the following program: P1: { P2: shared int x; x-10; while (1)[ shared intx; x 10 while (1) X-x- 1; x=x+1; if (x !- 10) X-X- 1; x=x+1; if (x!-10) printf("X is %d",x) printf("X is %d",x) Note that the scheduler in a uniprocessor system would implement pseudo-parallel execution of these two concurrent processes by interleaving their instructions, without restriction on the order of the interleaving. a. Show a sequence (i.e., trace the sequence of interleavings of statements) such that the statement "x is 10" is printed. Show a sequence such that the statement "x is 8" is printed. You should remember that the increment/decrements at the source language level are not done atomically, that is, the assembly language code: b
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
