Suppose two threads with a shared variable "x" execute the following instructions: shared int x; P1: _ x=0; x = x + 1; x = x + 1; x = x - 1; x = x - 1; _ if(x=1) cout << "Hi mom!" << endl; P2: - I x = 0; x = x + 1; x = x + 1; x = x - 1; x = x - 1; if (x=1) cout << "Hi mom!" << endl; Show this code can print "Hi mom!” by finding a sequence of instructions that can cause a race condition. Illustrate your sequence by numbering the instructions with the order in which they are executed.

Suppose two threads with a shared variable "x" execute the following instructions: shared int x; P1: _ x=0; x = x + 1; x = x + 1; x = x - 1; x = x - 1; _ if(x=1) cout << "Hi mom!" << endl; P2: - I x = 0; x = x + 1; x = x + 1; x = x - 1; x = x - 1; if (x=1) cout << "Hi mom!" << endl; Show this code can print "Hi mom!” by finding a sequence of instructions that can cause a race condition. Illustrate your sequence by numbering the instructions with the order in which they are executed.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 14VE

See similar textbooks

Similar questions

Lab 4 Directions Write a C program called threadcircuit to run on ocelot which will provide a multithreaded solution to the circuit-satisfiability problem which will compute for what combinations of input values will the circuit output the value 1. This is the sequential solution, which is also attached. You should create 6 threads and divide the 65,536 test cases among them. For example, if p=6, each thread would be responsible for roughly 65,536/6 number of iterations (if it's not divisible, some threads can end up with one more iteration than the others). The test cases must be allocated in a cyclic fashion one by one. #include <stdio.h>#include <sys/time.h>/* Return 1 if 'i'th bit of 'n' is 1; 0 otherwise */#define EXTRACT_BIT(n,i) ((n&(1<<i))?1:0)int check_circuit (int z) { int v[16]; /* Each element is a bit of z */ int i; for (i = 0; i < 16; i++) v[i] = EXTRACT_BIT(z,i); if ((v[0] || v[1]) && (!v[1] || !v[3]) && (v[2] || v[3])…
1) Implement three threads USING the C# code given in Philosopher problem to solve the following problem. Use the minimum number of semaphores so the printed variable sum is the sum of numbers from 0 to 100. Thread 0 Thread 1 Thread 2 for i=0 to 100 for i=0 to 100 { { { sum=sum0+sum1 İf if is odd then if if is even then Print(sum) sum0=sum0+i sum1=sum1+1 } } }
In C++ This exercise involves implementing the solution to the bounded buffer/readers and writers problem using threads. You will create a program that accepts four command line arguments: run_time (the length of time the program should run) buffer_size (number of slots in the bounded buffer) num_producers (number of producer threads) num_consumers (number of consumer threads) The program will create a thread for each producer and consumer. As each thread produces or consumes a data item, it will print its status. Example Output Here are some sample runs: Not enough arguments If not enough arguments are provided, the program should print an error message and exit. $ ./bounded_buffer Wrong number of arguments. Usage: bounded_buffer <run_time> <buffer_size> <num_producers> <num_consumers> $ Invalid argument If an argument is less than or equal to 0, the program should print a message and exit $ ./bounded_buffer 10 5 1 0 ./bounded_buffer 10 5 1 0 num_consumers…
The following question is related to Threading in C programming Task-2: Write a program in c using 5 threads where each thread will print 5 integers The outputs will look like this: Output: Thread 0 prints 1 Thread 0 prints 2 Thread 0 prints 3 Thread 0 prints 4 Thread 0 prints 5 Thread 1 prints 6 Thread 1 prints 7 . . . . Thread 5 prints 21 . . Thread 5 prints 25
Const N = 50; Var Tally: integer; Procedure Total; Var Count:integer; Begin For Count := 1 to N do Tally := Tally + 1 End; End; Begin (* main program *) Tally := 0; Parabegin Total; Total; Paraend; Write (Tally) End. Compose a thread safe pseudocode version that guarantees the upper and lower bound of the shared variable Tally are the same value after execution.
Make a C / C++, Java, or Python program with two processes (or threads, whichever is easier for you to code), a producer and a consumer. If you want to use another language, clear it with me first. The producer process/thread consists of a loop that writes the loop count (a value from 0 to 4) into a variable that it shares with the consumer process/thread (this variable is to be initialized to 100). On each pass through the loop, before the producer writes into the shared variable, it does a random wait of from one to three seconds (compute a new random wait value on each pass through the loop). The loop is to be executed five times. The consumer process consists of a loop that reads the variable it shares with the producer five times and computes the sum of the values it has read. On each pass through the loop before it reads the shared variable, it does a random wait of from one to three seconds (compute a new random value on each pass through the loop). When the loop finishes, the…
Multi-threading A) Write a Thread class (called worker) that takes two numbers (A and B, A < B) and calculates the products of all numbers between A and B. the result is stored in a local variable than can be accessed through a get method. B) Write a main program to calculate the factorial of a given number n (). The main thread reads n from the user, then creates two instances of Worker. Each one is requested to calculate the half of numbers between 1 and n. Once they finish, the main thread will gather their results and print the final result (result1 x result2). Example when n=10
Write program for the following Create a child thread class for sorting an array of 10000 size string values Create a child class for calculating factorial of 50 Create a child thread class for calculating base b to the power p Create a single object of each thread in the main thread, and stop the execution of main thread until the termination of all child threads using join method
Must attach output screenshot apply a proper thread synchronization technique #include #include using namespace std; int result = 0; void add1() { for(int i=0; i
THREAD -"C LANGUAGE" ONLY Write a program that uses 5 threads. Initialize a shared variable with a value of 0. Each thread must add its Thread ID (tid) to the shared variable. Once a thread has done the addition, print the ID of the thread. It is important to make use of mutexes so that only one thread is incrementing the shared variable at a time. Output the value of the shared variable once all threads have finished incrementing it.
2. Implement concurrent processing using multithreading Create a Java program which calculates the factorial for 5 numbers (values ranging from 1 to 10) specified by user. E.g. Enter 5 numbers [1-10]: 10 3 67 4 The factorials for 10 3 6 7 4 are 3628800 6 720 5040 24 You must use multithreading to perform the processing, by creating a thread to calculate the factorial for each number given. The threads may store all the results into a single array. Then print out the results after all results has been calculated and stored inside the array (You may also use other data structure other than array if it is more suitable).
Write a C++ code that uses multithreading to calculate the sum from 1 to 10,000 divide the number on 4 threads example thread 1 calculates the sum from 1 to 2500 and thread 2 from 2500 to 5000 and so on until 10,000 using only one function.