Question 1: The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process PO Process P1 Process P2 while(true) { wait (S0); print '0'; signal(S1); signal(S2); wait(S1); signal(SO); wait(S2); signal(S0); What is the maximum number of times that PO can print "0"?

Question 1: The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0. Process PO Process P1 Process P2 while(true) { wait (S0); print '0'; signal(S1); signal(S2); wait(S1); signal(SO); wait(S2); signal(S0); What is the maximum number of times that PO can print "0"?

Name: I want sooution with step Question 1: The following program consists o
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: I want sooution with step Question 1: The following program consists of 3 concurrent processes and 3 binarysemaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.Process POProcess P1Process P2while(true){wait(S0);print '0';signal(S1);si

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 0,S1 = 1 and S2 = 1. Process P0:while (true) { wait (S0); print '1';release(S1);release(S2);} Process P1:wait (S2);release (S0); Process P2:wait(S2);release(S0); How many times will process P0 print '1'?
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
In the above, we had the three concurrent processes p1, p2 and p3, each with the number s1 = 2, s2 = 3 and s3 = 2 of states, respectively.
you are tasked with analyzing an algorithm which schedulea processes in a multiprogramming system. You are working with a computer that has two CPUs, each CPU having two threads (hyperthreading). You are studying a scenario with three processes: P0, P1, & P2., with run times of 5, 10, & 20 msecs, respectively. All 3 programs are 100% CPU bound, don't block, and always run in the CPU it's assigned to. How long will it take for these programs to complete execution. Show three different possible outcomes (and assigned process to processor, 3 different combinations and resulting total time for all three to complete)
32. Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]);wait (m[(i+1) mode 4]); ......... release (m[i]); release (m[(i+1)mod 4]); This could cause a. Thrashing b. Deadlock c. Starvation, but not deadlock d. None of the above
Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4 fixed size partitions. Partition one of size 50, partition 2 of size 200, partition 3 of size 100 and partition 4 of size 150 Consider First 5 letters of your name. The ASCII code of the letters is the size of process and the alphabet is the name of process. The processes appear in alphabetical order. Q= How many processes will be loaded in the memory at a time? For contiguous memory allocation show the algorithms used to allocate memory partitions to each process and state which algorithm will work best and why? Also state the amount of internal and external fragmentation for the processes and partitions after allocation NOTE :MY NAME IS ALIZAHID
List the 4 conditions that can cause a deadlock for concurrent processes P1 and P2. (short answer is ok)
Answer the given question with a proper explanation and step-by-step solution. Consider the following source code, where k,l and m are constants declared with #define. The struct lnode is as defined as: struct lnode { char *str; // points to 32-character string struct lnode *next; // points to next node address struct lnode *prev; // points to prev node address }; You will need to determine the values for k, l and m, which are the dimensions of a 3-D array named A. struct lnode A[k][l][m]; int store_ele(int h, int i, int j, struct lnode dest) { A[h][i][j] = dest; return sizeof(A); } On compiling this program (with gcc -O2 -S -fno-asynchronous-unwind-tables) ,gcc generates the following assembly code for the store_ele function: store_ele: endbr64 movslq %edi, %rdi movslq %edx, %rdx movslq %esi, %rsi movdqu 8(%rsp), %xmm0 movq %rdi, %rax leaq (%rdx,%rdx,2), %rdx salq $6, %rax subq %rdi, %rax salq $4, %rax leaq (%rax,%rdx,8), %rax leaq (%rsi,%rsi,4), %rdx leaq (%rsi,%rdx,4), %rdx leaq…
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo codefor implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer threaddo {…produce next item…wait(empty);wait(mutex);…add the item to buffer…signal(mutex);signal(full);} while (1);//Consumer threaddo {wait(full)wait(mutex);…remove next item from buffer…signal(mutex);signal(empty);…consume the item } while (1); it consumes and produce the alphabets not numbers sample output is attached you please also attach your sample output
Develop a program in C to create three processes A, B and C. Job of these individual processes are as follows: Process A: Reads n numbers from the keyboard and counts the number of odd numbers in it. Then this count will be sent to the Process B. Process B: Reads the count from Process A and determines the fibonacci sequence of that count. This fibonacci sequence result will be sent to the process C. Process C: This process reads the fibonacci sequence from process B and sort the numbers in descending order.
You could implement an application as either a uni-threaded process or a multi-threaded process or as multiple 1) Discuss the pros and cons of each of the three approaches listed above 2) In case you choose the multi-threaded process approach, how does it matter whether the threads are user-level threads or kernel-level threads? Discuss the pros/cons of both 3) If you were using kernel level threads and your machine is a uniprocessor, is there any benefit in running the application as a multi-threaded process versus; a uni-threaded process?
Imagine that you have implemented an algorithm in a program which has 40% parallelizable code. Now consider the following two cases assuming that scheduling overhead is ignored: -The program is executed on a single processor. -The program is executed on a parallel system with 4 processors. Compute the speed-up gained in the case where multiple processors are used.