The question is about concurrent programming.(a) Consider a concurrent system with three processes P1, P2 and P3.//Process P1void P1(void) {}Statement A//Process P2void P2(void) {}Statement B//Process P3void P3 (void) {Statement C}Provide a (semaphore based) solution to synchronize P1, P2 and P3 such that thefollowing constraints on execution order is satisfied:Statement B before Statement A,Statement A before Statement CProvide a possible (deadlock free) trace of your solution.

Concurrent computing which refers to the one it is a form of computing in which several computations…

The question is about concurrent programming. (a) Consider a concurrent system with three processes P1, P2 and P3. //Process P3 void P3(void) { Statement C } //Process P1 void P1(void) { } Statement A //Process P2 void P2(void) { } Statement B Provide a (semaphore based) solution to synchronize P1, P2 and P3 such that the following constraints on execution order is satisfied: Statement B before Statement A, Statement A before Statement C Provide a possible (deadlock free) trace of your solution.

The question is about concurrent programming. (a) Consider a concurrent system with three processes P1, P2 and P3. //Process P3 void P3(void) { Statement C } //Process P1 void P1(void) { } Statement A //Process P2 void P2(void) { } Statement B Provide a (semaphore based) solution to synchronize P1, P2 and P3 such that the following constraints on execution order is satisfied: Statement B before Statement A, Statement A before Statement C Provide a possible (deadlock free) trace of your solution.

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

a)Consider the producer-consumer problem, Assume that the Consumer Process happens to run first and this process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute). b) Assume that the Consumer Process is swapped out, and the Producer Process gets its chance to run, and the Producer Process is allowed to run for about 10ms (it means that its running time can be very long). Describe what happens and explain any changes to any of the shared variables, and the flow of control (which statements in the Consumer Process execute).
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 Consider the following pseudo-code, assuming nested subroutines and static scoping: main () { } int g = 0; int x = 9; function B(int a) { int x = a + 5; R (1); } function A (int n) { g=n; } function R(int m) { print x; x = x / 2; if (x > 1) else R (m + 1); A (m); } // body of main B (3); print g; 1. What does the program print? 2. Draw a diagram of the runtime stack when function A has just been called. For each frame, show the static and dynamic links. 3. Refer to the runtime stack, briefly explain how function A finds variable g.
Create a C++ program code and the scheduling that is used is Multilevel queue scheduling (FCFS, RR (Time Quantum = 2), Priority) Requirements: a. Gantt Chart b. Average Waiting Time c. Average Turnaround Time
I need the answer as soon as possible
2. a) Your colleague has invented a new scheduling algorithm using the multilevel queue approach. This list of processes showing CPU burst times is below. There are three queues used in the application. The processes all start on the first queue and receive upto 10ms of burst time. Once the process has received the 10ms on the first queue, if the process still requires burst time it is passed to the second queue where it receives upto 20ms. Once the process has received the 20ms on the second queue, if the process still requires burst time it is passed to the third queue where it receives CPU time until it is completed. The operating system will only start allocating CPU time to processes on the second queue when queue 1 is empty. The operating system will only start allocating CPU time to processes on the third queue when queue 2 is empty. Process Number P1 P2 P3 P4 Burst time (ms) 21 8 35 50 i) Does this algorithm give higher priority to any queue over the others and any processes…
J5
I eant solution with step
Problem 4 There are two approaches for scheduling tasks on multiprocessor platform: the partitioned approach and the global approach. The table below shows Ci (WCET) and Ti (period) for six periodic tasks to be scheduled on m = 3 processors. The relative deadline of each periodic task is equal to its period. T T1 10 T2 10 25 T3 12 30 T4 10 T5 8. 20 T6 7 100 The task set is schedulable using rate-monotonic partitioned scheduling algorithm. Show how the task set is partitioned on m = 3 processors so that all the deadlines are met?
b. Consider the extract from a C program below, explain what would happen to the other processes on the system if this code is run: i. On a pre-emptive multitasking operating system ii. On a co-operative multitasking operating system double h,w; char *p = ...; // Points to a block of memory to store the data for (h - 0; h < 600; h++) { double y = (h * (2.0 / 600.0)) - 1.0; for (w - 0; w < 800; wt+) double x = (w * (3.0 / 800.0)) - 1.5; int it - 4096; double r = 0, i - 0, r2 - 0, 12 - 0; do tmp - r2 - i2 + x; i - 2 *r * i+ y; r - tmp; r2 -r* r; 12 - i* i; } while( (r2 + i2) <- 4.0 66 (--it) !- 0); if(it 0) *p++ - 0; else *p++ - 255:
Answer all questions in java
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.