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

Solve a generalized dining philosopher problem, In this project, you will i...

In this project, you will implement the Chandy and Misra's (CM) algorithm using POSIX Threads (Pthreads).   The algorithm  is a distributed algorithm to solve a generalized dining

User threads control dispatching, Consider a particular system that does no...

Consider a particular system that does not have an interrupting clock.  The only way a thread can lose the processor is to voluntarily surrender it.  Additionally, the operating sy

Cosled loop, What are the two principles in Hungarian method?

What are the two principles in Hungarian method?

What is the kernel, What is the kernel? A more common explanation is th...

What is the kernel? A more common explanation is that the OS is the one program running at all times on the computer  usually known as the kernel, with all else being applicati

Action taken by the operating system when a page fault occur, Q. Under what...

Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to

Illustrate different ways that threads could be implemented, Q. Multithread...

Q. Multithreading is a commonly utilized programming technique. Illustrate three different ways that threads could be implemented. Describe how these ways compare to the Linux clon

What is demand paging, What is Demand paging? Virtual memory is commonl...

What is Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a

What is directory, What is Directory? The device directory or simply ca...

What is Directory? The device directory or simply called as directory records information-such as name, location, size, and type  for all files on that certain partition. The d

Define overflow chaining, Define Overflow Chaining Another method will ...

Define Overflow Chaining Another method will divide the pre-allocated table into two sections: the primary area to determine which keys are mapped and an area for collisions, g

Introduction to paging, We will brie?y introduce paging to ?nish off this l...

We will brie?y introduce paging to ?nish off this lecture. When a process is loaded, not all of the pages are immediately loaded, since it's possible that they will not all be need

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