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.)
What are the different methods for handling deadlocks? Deadlock detection and recovery: Permit the system to enter a deadlock state, detect it and after that rec
College life is tough. Eating pizza for every meal is hitting you hard. You are looking at working out to stay healthy. You found a web site that tells you how many calories eac
Q. How would utilize of a RAM disk affect your selection of a disk-scheduling algorithm? What factors would you require to consider? Do the similar considerations apply to hard-di
Select any business process within this firm, describe it as a set of steps then fill the following table (flow, information, sender and receivern #Minimum 100 words accepted#
Present your own fully documented and tested programming example illustrating the problem of unbalanced loads. Describe the use of OpenMP's scheduler as a means of mitigating this
What are the operations that can be performed on a directory? The operations that can be performed on a directory are Search for a file Create a file Delete a
WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVICES PROVIDE BY OS
We have talked about blocking locks, which voluntarily yield, and spinlocks, which just spin until they acquire the lock. At ?rst, it seems like spinlocks are verywasteful, and tha
KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl
Gopher Gallery consists of a shopping mall and a cart ride that covers the 150 acre habitat. There are m visitors and n single-person vehicles. Visitors stroll around the mall at
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