Pand Q are two processes that share a set of variables that is common. The variable includes: seq, tA and tB: Before either process starts to execute, variable seg initially has the value 10. State the possible sets of different values of seg when both processes have finished executing. Provide an order of execution of statements from processes P and Q tha would produce each of the values you give. Justify your answer in detail.

Pand Q are two processes that share a set of variables that is common. The variable includes: seq, tA and tB: Before either process starts to execute, variable seg initially has the value 10. State the possible sets of different values of seg when both processes have finished executing. Provide an order of execution of statements from processes P and Q tha would produce each of the values you give. Justify your answer in detail.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 25VE

See similar textbooks

Similar questions

It is recommended that, in the event of a standstill, those processes be terminated, which will result in the following outcomes:
Please explain step by step how processes are created. 1. Including the parent process, how many processes are created by the following program? Assumethat all fork() system calls succeed. #include <unistd.h>#include <stdio.h>int main(int argc, char **argv) {for (int i = 0; i < 3; i++)fork();/* ... */}2. Given the following program, please determine how many times the word “hello” is printed out.Assume that fork() is always successful. #include <sys/types.h>#include <stdio.h>int main() {pid_t a, b;a = fork();b = fork();if (a == 0)b = fork();if (b == 0)a = fork();printf(“hello\n”);return 0;} 2. Given the following program, please determine how many times the word “hello” is printed out.Assume that fork() is always successful. [1 pt]#include <sys/types.h>#include <stdio.h>int main() {pid_t a, b;a = fork();b = fork();if (a == 0)b = fork();if (b == 0)a = fork();printf(“hello\n”);return 0;}
Which among the following could be the possible examples of concurrent process? a. Check marks and check grade b. Order and Deliver c. Accept and Reject d. Sit and Swim
Is it feasible for a single process to get halted in the midst of its execution at any point? Please offer arguments for your replies.
A deadlock occurs when a group of processes is stalled because one process is holding a resource and waiting for another process to obtain it. Consider the situation when two trains are approaching each other on the same track and there is only one track: once they are in front of each other, neither train can proceed. In operating systems, a similar scenario happens when two or more processes possess certain resources while waiting on resources owned by other processes (s). In the picture below, Process 1 is holding Resource 1 and waiting for Process 2 to acquire Resource 2, while Process 2 is waiting for Resource 1. Give an example of a realistic deadlock avoidance approach and describe the basic strategy behind it.
In the event of a deadlock, those processes should be abandoned, leading to the following results:
A- Explain how you can improve the theoretical capacity of a process? B-Discuss four attributes that are not observable at runtime in your own words?
102. The two ways of aborting processes and eliminating deadlocks are : a. Abort all deadlocked processes b. Abort all processes c. Abort one process at a time until the deadlock cycle is eliminated d. All of the mentioned
15. Situations where two or more processes are reading or writing some shared data and the final results depends on the order of usage of the shared data, are called ________. a. Race conditions b. Critical section c. Mutual exclusion d. Dead locks
Given is the scenario for the three processes p0,p1 and P2. You need to find out whether deadlock has detected or not? (If yes, then explain in the sheet which processes can't be executed and if no, what is the safe sequence and how?) In option, you are supposed to mention yes and no for deadlock detection. (A) Yes, deadlock is detected (B) No, deadlock is not detected
In the event of an impasse, it becomes necessary to terminate said processes, thereby leading to the subsequent consequences:
For the following problem, please do not provide me any code. I will give you my code please check it and make corrections as necessary. Write a c program that will generate the safe sequence of process execution for the situationgiven below:(Use Banker’s Algorithm).Note: The code can be implemented in several different ways, but make sure the parameterremains the same as shown below.n = 6; // Number of processesm = 4; // Number of resourcesint alloc[6][4] = { { 0, 1, 0, 3 }, // P0// Allocation Matrix{ 2, 0, 0, 3 }, // P1{ 3, 0, 2, 0 }, // P2{ 2, 1, 1, 5 }, // P3{ 0, 0, 2, 2 }, // P4{1, 2 , 3, 1 } }; //P5int max[6][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix{ 3, 2, 2, 4 }, // P1{ 9, 1, 2, 6 }, // P2{ 2, 2, 2, 8 }, // P3{ 4, 3, 3, 7 }, // P4{ 6, 2 , 6, 5 } }; //P5int avail[4] = { 2, 2, 2, 1 }; //Available resources My Code for the above problem: #include <stdio.h> int main() { int n, m; n = 6; // Number of processes m = 4; // Number of resources //…