LAB MAKEUP 1Initial value of shared variable m is equal to 0. Four threads A, B, Y, Z use this variable as follows:Processes A and B increase the value of m by 1. Processes Y and Z decrease the value of m by 1.Since m is shared, each process protects the critical region using semaphore S initialized to 2.Run your program to show that it is possible that m's value can be equal 2 after all processes runonce.S=2Proses AW(S)m=m+1S(S)ADD TEXT OF YOUR CODE HEREProses BW(S)m=m+1S(S)ADD PRINTSCREEN OF YOUR OUTPUT HEREProses YW(S)m=m-1S(S)Proses ZW(S)m=m-1S(S)

NOTE: In the question the student did not mention the programming language. So, here am using C…

Answered: Initial value of shared variable m is…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Consider the following data that are shared between two threads and are initialised before the threads are executed, as follows: boolean flag = true; int x = 50; Thread 1 is defined as follows: void run_thread1() { while (flag) { } print x; } Thread 2 is defined as follows: void run_thread2() { x = 60; flag = false; } Let us assume that, as there are no data dependencies between the variables flag and x, it is possible that a processor may reorder the instructions for Thread 2. Which of the following statements regarding the possible output of Thread 1 is TRUE? Thread 1 could enter an infinite loop The output could only be 50 The output could either be 50 or 60 None of the mentioned The output could only be 60
Write a Python script that starts 3 counters using 3 new processes. All processes should be based on a single function (i.e. "counting()"). The function should take 1 parameter representing the target of the counter (i.e. if count_to=12 then the process should print 1,2,3,4...,12 ). Start each process with a different target of the counter. How many objects does the gc track in each process before and after the counter completes its task?
Consider the following program: const int n=10; int s; //shared variable between two processes (threads) void P1( ) { int i=0; for (i=0;i
You'll write a C++ program to demonstrate thread synchronization. Your main function should first create an empty file called *sync.txt*. Then it will create two separate threads: *Thread-A* and *Thread-B*. Both threads will open *sync.txt* and write to it simultaneously. *Thread-A* will write the numbers 0 through 9, a total of fifty-thousand times in nested `for` loops, then exit. In other words, print the numbers 0 through 9 over and over again, with each run on a separate line, for 50,000 lines. Here's an example of one such line: ```text 0 1 2 3 4 5 6 7 8 9 ``` Somewhat similarly, *Thread-B* will write the letters A through Z fifty-thousand times in nested `for` loops, then exit. In other words, print the letters A through Z over and over again, with each run on a separate line, for 50,000 lines. Here's an example of one such line: ```text A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ``` Do not write each line as one long string. You must write each character to the…
In a printing queue, there are a few documents that are still waiting to be printed. To get the documents running, the person in charge of printing executes a series of random activities. Which type of scheduling is best for the aforementioned circumstance, and why?
USE SIMPLE PYTHON CODE TO COMPLETE Basic version with two levels of threads (master and slaves) One master thread aggregates and sums the result of n slave-threads where each slavethread sums a different range of values in an array of 1000 random integers (please program to generate 1000 random integers to populate the array). The number of slave-threads is a parameter which the user can change. For example, if the user chooses 4 slave threads, each slave thread will sum 1000/4 = 250 numbers. If the user chooses 3 slave threads, the first two may each sum 333 numbers and the third slave threadsums the rest 334 numbers. 2) Advanced version with more than two levels of threadsThe master thread creates two slave-threads where each slave-thread is responsible to sum half segment of the array. Each slave thread will fork/spawn two new slave-threads where each new slave-threadsums half of the array segment received by its parent. Each slave thread will return the subtotal to its parent…
In general, deadlocks involve nonpreemptable resources. Group of answer choices True False
Part II: Processes and Threads. Write a C program that will creates a child process. The child will ask the user to enter an integers x and then sends it to the parent via pipe. The parent should print your student's ID if x > 0 or your full student name if x 0 and 01998877 if x <= 0. Note: cach student should print his own id and name as they appear on the UMS. The inter-processes communication should be using pipes.
3. I/O Management: Disk Arm Scheduling & RAIDa. It is known that a disk drive has 256 cylinders, with cylinder numbers starting from 0 and ending at 255. The position of the needle on the disk drive currently stops at 128. It is also known that the needle always “goes to the cylinder with the smaller number first”. The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. From the 3 choices of algorithms below, which one is the best algorithm? Make each image and determine the seektime.i. SCANii. C-SCANiii. FIFO

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS