2 ) Consider two processes PO and P1 which shares a global variable 'flag'. The value of flag is either 0 or 1 where 0 indicates "PO is permitted to enter into critical section" and 1 indicates for P1. Assume PO and P1 are concurrent processes which are executing the following code with initial value of flag as 0. while(1) { While(flag!=i); flag=1-i; } If PO starts executing first, which of the following holds by the above execution? A) Mutual Exclusion B) B) Progress C) C) Bounded waiting D) D) Both (A) and (C) Justify your answer.

2 ) Consider two processes PO and P1 which shares a global variable 'flag'. The value of flag is either 0 or 1 where 0 indicates "PO is permitted to enter into critical section" and 1 indicates for P1. Assume PO and P1 are concurrent processes which are executing the following code with initial value of flag as 0. while(1) { While(flag!=i); flag=1-i; } If PO starts executing first, which of the following holds by the above execution? A) Mutual Exclusion B) B) Progress C) C) Bounded waiting D) D) Both (A) and (C) Justify your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Assume that there are the following processes in the deadline scheduler queue: Process Arrival Runtime Period Deadline 1 0 2 12 10 2 2 4 20 16 3 4 3 15 14 Complete the following schedule so each of the processes adheres to the deadline policy by replacing a dot with a process number (as necessary): TIME: 01234567890123456789012345678901234567890123456789 PROCESS: 112222333.......................................
1. Two processes, A and B, each need three resources, 1, 2, and 3. Suppose 4 requests them in the order 1, 2, 3. If B also requests them in the same order, deadlock is not possible. However, if B requests them in the order 3, 2, 1, then deadlock is possible. With three resources, there are 3! or six possible orders in which B can request them. For each possible order in which B can request these resources, state whether or not a deadlock is possible for that order. (Assume that once a process acquires a resource, it does not release that resource until the end of that process.) a) 1, 2, 3 b) 1,3,2 c) 2, 1, 3 d) 2, 3, 1 e) 3, 1, 2 f) 3, 2, 1
I need to implement in C the First-come, first-served (FCFS), which schedules tasks in the order in which they request the CPU. Priorities range from 1 to 10. Where the file driver.c reads in the schedule of tasks, inserts each task into a linked list, and invokes the process scheduler by calling the schedule() function. The schedule() function executes each task according to the specified scheduling algorithm. Tasks selected for execution on the CPU are determined by the pickNextTask() function and are executed by invoking the run() function defined in the CPU.c file. A Makefile is used to determine the specific scheduling algorithm that will be invoked by driver.
Suppose a system has 5 processes, P = {P1, P2, P3, P4, P5}, and 4 resources, R = {R1, R2, R3, R4}, where there are 2 instances of R1, 1 instance of R2, 3 instances of R3, and 3 instances of R4. The current state of the system is defined by the following requests and assignments: P1 is requesting an instance of R3 and has been assigned an instance of R2; P2 is requesting an instance of R1 and has been assigned an instance of R3; P3 is requesting an instance of R4 and has been assigned an instance of R1 and an instance of R3; P4 is requesting an instance of R3; P5 is requesting an instance of R2 and has been assigned an instance of R4. Is there deadlock in this system? (Explicitly state yes, there’s deadlock or no, there isn’t.) If applicable, draw a wait-for graph or resource-allocation graph, and use the appropriate graph to justify your answer. If you conclude there is no deadlock, your justification should contain a sequence of execution for the processes which shows that…
P and 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 that would produce each of the values you give. Justify your answer in detail. P P1: tA= seq + 1; P2: seq = tA; tily has the value 10. Q Q1: tB = seq+ 2; Q2: seq = tB;
Solve the IP (Integer Programming) problem below. The answer must be coded in C++ language. Explain on how you get the solutions.
Code must be in C/C++ language using MPI Suppose comm_sz = 8 and the vector x = (0,1,2,...,15) has been distributed among the processes using a block distribution. Implement an allgather operation using a butterfly structured communication (see diagram below) and point-to-point communication functions
In concurrent programming, a "critical section" is a part of a multi-process program that a) may not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do { flag[i] = TRUE; while(flag[j]); %wait CRITICAL SECTION flag[i] = FALSE; REMAINDER SECTION } while (TRUE); Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) } Does the given solution sattisfy the mutual exclusion requirement? Explain (a (i) í simple 'yes-no' answer is NOT enough. What is the mutual exclusion requirement? Why is (not?) sattisfied?) (ii) (iii) your answer (no point without a valid simluation) (iv) deadlock), how can you modify the given solution to make it working? Does the given solution sattisfy the progress requirement? Explain Does the given solution have the risk of deadlock? Make a simulation to support if your answer to the previous question is positive (i.e. Yes, there is the risk of
Write a C code which consists of a parent process with two child processes. The parent process will control the execution of both child processes giving them alternatively a specific time after which the executing process will be stopped by the parent and resume the execution of the second child. The body of both children processes consist of print their pids in an infinite loop. Hint use fork and signals.
To write a C-program to implement the producer-consumer problem using semaphores
P and 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 that would produce each of the values you give. Justify your answer in detail. P ... P1: tA= seq + 1; P2: seq = tA; .. atle seg inally has the value 10 Q1: tB = seq+ 2; Q2: seq = tB;
Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.