Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Since each thread has its own processing space therefore communication between threads will need to be done through a common global variable. Since multiple threads can access the same global variable this can leads to race condition. Therefore what we want is to protect the variable so that only one thread can access the variable at any time. In POSIX this is done via the mutual-exclusion variable, mutex. A mutex variable allow us to perform the lock/unlock action so that the critical section of the code can be protected.
A mutual exclusion variable is lock using the function call pthread_mutex_lock(&mutex_variable) and unlock using the function call pthread_mutex_unlock(&mutex_variable). When a mutex variable is locked any other thread attempt to lock it will be blocked and have to wait until the variable is being unlocked. A mutex variable is declared using the following syntax:
pthread_mutex_t mutex_variable=PTHREAD_MUTEX_INITIALIZER; One problem of mutex is the possibility of deadlock if more than one resource is required for processing. Assume there are two mutexes in total being accessed by two separate threads. If each thread is allowed to lock only one of the two mutex that is required by each thread, then everything will be at a standstill while each thread wait for the other mutex to be unlocked. To see the effect of deadlock compile and run the program intro_mutex_deadlock.c. Does the thread terminate? The answer is no. It is because PrintProcess1 always lock mutex_lock_1 first then mutex_lock_2 while PrintProcess2 always does it in the reverse order. This is known as circular wait, which is one of the four necessary condition required for deadlock. Therefore when multiple mutex are involved the order of the mutex lock is very important. Modify the program so that PrintProcess2 lock the mutex in the same order as PrintProcess1. The deadlock should now be resolved and both threads can complete to termination.
(Note that this is one of the four conditions required for deadlock to occur: circular wait. As an exercise, list the other three necessary conditions for deadlock and identify which part of the intro_mutex_deadlock.c source code satisfies the condition. See if you can modify the program such that the deadlock can be avoided by eliminating each of the required condition.)
Question 1: (a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems. (b) Explain your understanding of the "sus
when demand is 24000 units/year, production rate is 48000 units/year, setup cost is rs 200 per setup, carring cost is rs 20 per units/year, and economic batch quantity is 692.8203
write a linux command to display lines from 25 - 45 of directory "/edc/password" write a linux command to display directory in /edc
Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han
What is a Real-time system? A Real-time system is used when inflexible time requirements have placed on the operation of processor or the flow of data so it is often used as a
Operations that are to be performed on a directory are Search for a file: We are able to find all files whose names match a exact pattern. Create a file: New files requi
Explain fixed partitioning. Partitioning are the simpler techniques that don't involve virtual memory. Partitioning has been used in numerous variations in operating systems.
Explain the various types of computer systems. Mainframe systems Large Number of CPU with Greatest Processing Power: Huge Memory Capacity: Increased Performance by s
Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are
Unix process API The two most important function calls to use when programming with several processes are fork and exec: fork() creates a copy of current process. It gives
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd