QUESTION 21 A race condition OA) results when several threads try to access the same data concurrently OB) results when several threads try to access and modify the same data concurrently OC) will result only if the outcome of execution does not depend on the order in which instructions are executed OD) none of the above QUESTION 22 A counting semaphore OA) is essentially an integer variable OB) is accessed through only one standard operation OC) can be modified simultaneously by multiple threads OD) cannot be used to control access to a thread's critical sections Click Save and Submit to save and submit. Click Save All Answers to save all answers.

QUESTION 21 A race condition OA) results when several threads try to access the same data concurrently OB) results when several threads try to access and modify the same data concurrently OC) will result only if the outcome of execution does not depend on the order in which instructions are executed OD) none of the above QUESTION 22 A counting semaphore OA) is essentially an integer variable OB) is accessed through only one standard operation OC) can be modified simultaneously by multiple threads OD) cannot be used to control access to a thread's critical sections Click Save and Submit to save and submit. Click Save All Answers to save all answers.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Problem 1: Thread creation (50%) a. Using Java multithreading library, write a Java program that calculates the sum of the numbers from 1 to 100,000,000. Split the numbers between four threads equally where each thread calculates the sum of one fourth of the numbers. For example, the 1st thread will calculate the sum of the numbers from 1 to 25,000,000 whereas the 2nd thread will calculate the sum of the numbers from 25,000,001 to 50,000,000 and so forth. The main thread will have to print out the sum after gathering the results. Note that you have the choice to create threads by either implementing Runnable interface or extending Thread class. b. Now, write a sequential version of the program described above using a single main thread (i.e., without multithreading). Make sure to record and print out the time spent during the execution of both sequential and multithreaded versions (hint: you may consider using System.currentTimeMillis() to record execution time).
Outline benefits and limitations of implementing two methods of creating threads.
An operating system provides a system call for requesting allocation of memory. An experienced programmer offers the following advice “If your program contains many requests for memory, you can speed up its execution by combining all these requests into a single system call ” Explain why this is so.
Determine the distinction between user-level threads and kernel-level threads.
Which is an example of statement-level concurrency? the manufacturer states that there are multiple processors on achip, but there is actually only one instructions are fetched form memory while previous instructions run a loop the performs the same operation on 500 array elements is split into five threads that perform the operation on 100 array elements each five threads that with loops that perform the same operations on 100 elements each from the same array are combined into one thread
When it comes to process scheduling, why are exceptions necessary?
Processes and Threads 7. 1 System: 2 3 // create semaphore and initialize value to 1 4 Semaphore occupied = new Semaphore (1); 5 startThreads(); // initialize and launch both threads 6 7 8 Thread T 9 10 void main() 11 { 12 while (!done) { 13 14 PC occupied ); // wait // critical section code 15 16 17 18 19 20 21 22 } // Thread TX V occupied ); // signal // code outside critical section } // end while 1 2 3 // create semaphore and initialize value to 1 4 Semaphore occupied = new Semaphore (1); 5 System: 6 startThreads(); // initialize and launch both threads 7 8 Thread T 9 10 11 12 13 14 15 16 17 18 19 void main() { while (!done) { PC occupied ); // wait // critical section code V occupied ); // signal // code outside critical section } // end while 20 21 22 } // Thread TX Assuming that P(occupied) and V(occupied) each takes 1 ms and critical section consists of 4 instructions cr1, cr2, cr3, and cr4 of equal instruction time adding up to 1 ms and noncritical section consists of 4…
IT 313 OPERATING SYSTEMS EXAMINATION QUESTIONS (Protected View) Microsoft Word out References Mailings Review View from an Internet location and might be unsafe. Click for more details. Enable Editing 12. But not parallelism, it is achievable to have concurrency in operating system threading? 13. The following processes are being scheduled using a priority (a smaller priority number implies a higher priority) and shortest job first all preemptive scheduling algorithms. Process Priority Burst Arrival P1 50 30 P2 40 35 25 P3 40 35 30 P4 45 25 60 P5 15 20 100 P6 20 20 105 Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms. What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all 1. 1. 111. iv. MEIZU PROp7ocesses)? DUAL CAMERA 14. In the…
Suresh and Ramesh started creating an application where it requires to do some mathematical operations.They are going to deploy it in a server. They wanted to do simultaneous execution of multiple parts ofprograms to utilize CPU time. They decided to create 2 separate threads for operations: num**2 andsqrt(num) with sleep of 100ms each.Write a program containing two threads and each thread should have a sleep of 100 ms. One thread is forcalculating the square of the elements in the array and other is for square roots.Trace the output in the threads only. Use Exception handling to handle and trace the interruptions if they occur.Input: An array. Can use static data. Preferably try to use run() and start().Output:"Thread 1"+ square(num)"Thread 2"+ square root(num)likewise to distinguish the thread status
Is the usage of user-level threads superior than kernel-level threads? What is the difference between user-level threads and kernel-level threads? Is there ever a period when one kind is superior than another?
How can a race condition in two threads be fixed? O Synchronizing structure at the beginning and end of one of the threads Synchronizing structure at the beginning and end of both threads O Synchronizing structure at the beginning of both threads O Synchronizing structure at the end of both threads O Changing the compiler
COURSE : OPERATING SYSTEMS In the Posix Thread (Portable Operating System Interface) there are various kinds of thread calls, state the 3 thread calls along with the purpose of using the thread call!