Mutual exclusion variable, Operating System

Assignment Help:

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.)


Related Discussions:- Mutual exclusion variable

Explain the concept of reentrancy, Explain the concept of Reentrancy? I...

Explain the concept of Reentrancy? It is a useful, memory-saving method for multiprogrammed timesharing systems. A Reentrant Procedure is one in which many users can share a si

Explain about file allocation methods, Explain about file allocation method...

Explain about file allocation methods? The main problem in direct-access nature is how to assign space to these files so that disk space if utilized effectively and files can b

Define file permission in unix, The permission function is used to calculat...

The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s

Write about critical regions and monitors, Write about critical regions and...

Write about critical regions and monitors. Critical region definition Monitor definition Implementation of the conditional-region construct Syntax of monitor Monito

How can the deadlock be prevented?, How can the deadlock be prevented? ...

How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that

Memory management, what is segmentation as it refers to operating system

what is segmentation as it refers to operating system

System call, how the system call is work?

how the system call is work?

Bio, how it is work.

how it is work.

Management, what is secondary storage management

what is secondary storage management

Define the os/2 threads code, Define the OS/2 threads code The sample p...

Define the OS/2 threads code The sample program in Listing is very similar to the NetWare example. OS/2 commands are substituted for the pseudocode commands controlling thread

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd