6. Initial value of shared variable m is equal to 0 and it is stored at memory address 1100. Fourthreads 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 thecritical region using semaphore S initialized to 2. Write the sequence of operations so that aftereach thread is executed once, the value of m is equal to -2.3assume the code is usedS=2Proses AA1: W(S)A2: LOAD m, 1100A3: ADD 1A4: MV A, 1100A5: S(S)Proses BB1; W(S)B2: LOAD m, 110083: SUBT 1B4: MV A, 110085: S(S)Proses YY1: W(S)Y2: LOAD m, 1100Y3: ADD 1Y4: MV A, 1100Y5: S(S)Proses 221: W(S)22: LOAD m, 110023: SUBT 124: MV A, 110025: S(S)

The operations that the four threads must perform once to result in the value of m being -2 are as…

Answered: 6. Initial value of shared variable m…

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 5RQ

See similar textbooks

Similar questions

Topic: OpenMP #pragma omp parallel for and #pragma omp master (Distributed and Parallel Computing Lab) The master construct denotes a block that is only executed by the master thread. Note that there is no synchronization (implicit barrier) for the master construct. The other threads will skip over this block and continue processing without waiting for the master thread. Write a program that computes the average of a large array using a parallel for construct. While it is running using #pragma omp parallel for construct, also use a master construct (outside the for loop) to keep track of how many iterations have been executed and prints out a progress report. Q. The following code is what I have written so far, but the ave(rage) value at the end comes as zero, and the number of iteration was only one, which I don't think it reflects what this program is supposed to do. Please, modify my current code to meet the criteria explained above. #include <omp.h>#include…
Fill in the blanks:5. The ( 6 ) is used to implement mutual exclusion where it can be decremented by aprocess and incremented by another, but the value must either be 0 or 1.6. If deadlock prevention approach is used to deal with deadlocks in a system, the ( 7 )condition can be prevented using the direct method.7. Two threads may share the memory space, but they cannot share the same ( 8 )8. Consider round-robin (RR) scheduling algorithm is implemented with 2 seconds timeslice and it is now selecting a new process; if we have 3 blocked processes (A, B, and C),and A has been waiting the longest, then A would need to wait a period of ( 9 ) secondsto be selected.9. In real-time systems, if a task appears at random times, then it is considered ( 10 ).
Consider an ARMv8 computer that is running more than one thread of execution. The computer has certain resources that must not be accessed or modified by different threads at the same time. These resources could be peripheral devices or memory buffers and data structures that are accessible by any threads. This type of concurrency control is a general computer science problem. It is possible to protect a shared resource by implementing a lock function, which allows a thread request ownership of the resource. An unlock function is necessary to allow software to release the lock. A simple lock system could be implemented using a variable in memory that can contain one of two values, LOCKED and, UNLOCKED. The action is to first read the value from memory, and if the lock is UNLOCKED then the value can be updated to LOCKED and written back to memory. This method is vulnerable to another thread modifying the value in memory in between the first read and the write-back of the new value. The…
Please write in C/C++Write a program that spawn 2 thread: a producer and a consumer The producer thread MUST open an input file and repeatedly copy values to a CIRCULAR BUFFER The consumer should open an output file and repeatedly copy values from the same circular buffer to the file. If the producer is unable to write to the buffer (because it does not contain enough empty elements), or if the consumer is unable to read from the buffer (because it does not contain enough unread items), then it should proceed to the next iteration, choosing a new random number of bytes to copy.
No screenshot needed, just explain the program and answer the red question to copy program /* Multi-threaded example */ #include <stdio.h> #include <stdlib.h> #include <pthread.h> #define NUM_THREADS 10 /*This data is shared by the thread(s) */ pthread_t tid[NUM_THREADS]; /*This is the thread function */ void *runner(void *param); int main(int argc, char *argv[]) { int i; pthread_attr_t attr; printf("I am the parent thread\n"); /* get the default attributes */ pthread_attr_init(&attr); /* set the scheduling algorithm to PROCESS(PCS) or SYSTEM(SCS) */ pthread_attr_setscope(&attr, PTHREAD_SCOPE_SYSTEM); /* set the scheduling policy - FIFO, RR, or OTHER */ pthread_attr_setschedpolicy(&attr, SCHED_OTHER); /* create the threads */ for (i = 0; i < NUM_THREADS; i++) pthread_create(&tid[i], &attr, runner, (void *) i); /* now join on each thread */ for (i = 0; i < NUM_THREADS; i++) pthread_join(tid[i], NULL); printf("I am the parent thread…
Describe the techniques for handling concurrent access issues when multiple processes or threads attempt to read or write to the same file simultaneously.
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
Course: Operating Systems write a multi-threadeddirectory copy program. The program will create destination directory and open thesource directory. Then for each file in the source directory it will create a thread. Thethread will copy file from source directory to the destination directory. At the end it willprint the number of files copied. Both the source and destination names will be passed ascommand line arguments. Sample execution is as follows:mtcopy.exe source_dir destination_dirCopied 8 files Note: The answer is availible on chegg.
Part 3: Interrupt handlingIn Java multithreading environment, one thread can send an interrupt to another by calling theinterrupt() method on the Thread object for the target thread (i.e., the thread to beinterrupted). To handle interrupts in a target thread, Java allows two approaches. One is performedby writing an exception handler for InterruptedException (only applicable if the targetthread is invoking methods which throw that exception such as sleep). The other approach isperformed by periodically checking the interrupt status flag Thread.interrupted andperforming the handling routine when that flag is set to true.Write a Java program that illustrates the use of the two approaches described above. Your programshould start by creating two threads, each thread should use different interrupt handling approach.Then, the program needs to send interrupts to each one of the created threads such that a threadneeds to return (i.e., stop execution) after receiving an interrupt from the main…
Use both Mutex lock and Semaphore to address the racing problem in the following program (example_thread.c). Please make sure that your output is always equal to 6,000,000. ====================================== example_thread.c ====================================== #include <stdio.h>#include <stdlib.h>#include <pthread.h>int shared= 0;void race(void);int main(){ pthread_t player1, player2, player3; pthread_create(&player1, NULL, (void *)race, NULL); pthread_create(&player2, NULL, (void *)race, NULL); pthread_create(&player3, NULL, (void *)race, NULL); pthread_join(player1, NULL); pthread_join(player2, NULL); pthread_join(player3, NULL); printf("Total Number = %d\n", shared); return 0;}void race(void) { long i,tmp; for(i=1; i<=2000000; i++) { tmp = shared; tmp = tmp + 1; shared = tmp; }}
The following page table is for a system with 16-bit virtual and physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The page-replacement algorithm is localized LRU, and all numbers are provided in decimal. Page Page Frame Reference Bit 0 7 0 1 − 0 2 14 0 3 13 0 4 15 0 5 8 0 6 0 0 7 − 0 8 4 0 9 5 0 10 − 0 11 1 0 12 9 0 13 3 0 14 − 0 15 2 0 Convert the following virtual addresses (in hexadecimal) to the equivalent physical addresses. You may provide answers in either hexadecimal or decimal. Also set the reference bit for the appropriate entry in the page table. 0xE13C 0x5A97 0x59D8 0x1002 0xCCB1 Using the above addresses as a guide, provide an example of a…
The following page table is for a system with 16-bit virtual and physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The page-replacement algorithm is localized LRU, and all numbers are provided in decimal. Page Page Frame Reference Bit 0 7 0 1 15 0 2 10 0 3 13 0 4 14 0 5 -- 0 6 5 0 7 0 0 8 -- 0 9 9 0 10 1 0 11 11 0 12 2 0 13 − 0 14 3 0 15 8 0 Convert the following virtual addresses (in hexadecimal) to the equivalent physical addresses. You may provide answers in either hexadecimal or decimal. Show the calculation steps Also set the reference bit for the appropriate entry in the page table. 0xD551 0x8D17 0x33E2

SEE MORE QUESTIONS

Recommended textbooks for you

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

Systems Architecture

Computer Science

ISBN:

9781305080195

Author:

Stephen D. Burd

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS