i. The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 =0, S1= 0, S2=0 Process PO Process P1 Process P2 wait(SO); wait(S1); wait(S2); print '1'; signal (S0); signal (S0); signal(S1); signal (S2);} How many times will process P0 print 1'?

i. The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 =0, S1= 0, S2=0 Process PO Process P1 Process P2 wait(SO); wait(S1); wait(S2); print '1'; signal (S0); signal (S0); signal(S1); signal (S2);} How many times will process P0 print 1'?

Name: Computer networking i.The following program consists of 3 concurrent p
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Computer networking i.The following program consists of 3 concurrent processes and 3 binary semaphores. Thesemaphores are initialized as S0 =0, S1= 0, S2=0Process POProcess P1Process P2wait(S0);wait(S1);wait(S2);print '1';signal (S0);signal (S0);sign

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'?
Modiflow y the beprogram given to include response time program;SJF CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> using namespace std; int main() { int p[20], bt[20], wt[20], tat[20], i, k, n, temp; float wtavg, tatavg; printf("\nEnter the number of processes--"); scanf("%d", &n); for(i=0;i<n;i++) { p[i]=i; printf("Enter Burst Time for Process %d--", i); scanf("%d", &bt[i]); } for(i=0;i<n;i++) for(k=i+1;k<n;k++) if(bt[i]>bt[k]) { temp=bt[i]; bt[i]=bt[k]; bt[k]=temp; temp=p[i]; p[i]=p[k];…
Modiflow y the beprogram given to include response time program;ROUND ROBIN CPU SCHEDULING ALGORITHM #include<stdio.h> #include<conio.h> using namespace std; int main() { int i,j,n,bu[10],wa[10],tat[10],t,ct[10],max; float awt=0,att=0,temp=0; printf("Enter the no of processes--"); scanf("%d",&n); for(i=0;i<n;i++) { printf("\nEnter Burst Time for process %d--", i+1); scanf("%d",&bu[i]); ct[i]=bu[i]; } printf("\nEnter the size of time slice--"); scanf("%d",&t); max=bu[0]; for(i=1;i<n;i++) if(max<bu[i]) max=bu[i]; for(j=0;j<(max/t)+1;j++) for(i=0;i<n;i++) if(bu[i]!=0) if(bu[i]<=t) { tat[i]=temp+bu[i];…
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…
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.
Write a C program to Implement a system of three processes which read and write numbers to a file. Each of the three processes P1, P2, and P3 must obtain an integer from the file (these instructions must be executed 200 times). The file only holds one integer at any given time. Given a file F, containing a single integer N, each process must perform the following steps 1. Fork two processes For 200 times: 2. Open F 3. Read the integer N from the file 4. Close F 5. Output N and the process' PID (On the screen) 6. Increment N by 1 7. Open F 8. Write N to F (overwriting the current value in F) 9. Close F b) Briefly describe why the processes P1, P2, and P3 obtain/read duplicates of numbers (why does a particular integer x appear in the output of more than one process)? Suggest a solution (you do not need to implement it) to guarantee that no duplicate numbers are ever obtained by the processes. In other words, each time the file is read by any process, that process reads a distinct…
) 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)
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
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=3 and is in powers of 2 (e.g. 2, 4, 8, 16, etc.). Your main routine shall generate a random page trace of size n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the LRU page replacement algorithm (as a separate function within your program). Your algorithm shall use the doubly linked list stack implementation as outlined in slide 29 of lecture 10). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main…
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…
The reader-writer problem can be stated as follows: A shared memorylocation can be concurrently read by any number of tasks, but when atask must write to the shared memory location, it must have exclusiveaccess. Write a Java program for the reader-writer problem.
Write a python code in multiprocessing (from mpi4py import MPI) to create a system with 3 processes, the master process sending a string (Take string as user input) to the child processes 2 and 3. The child process 2 prints the vowels in the string while process 3 prints the consonants in the string. In the above cases, print the details of who is printing and what is being printed. (Use mpi4py Python Package)