Recent questions tagged mutex / GATE Overflow for GATE CSE

0 votes

1 answer

1

Ace Test Series

Neelu Lalchandani

573 views

Neelu Lalchandani asked Aug 19, 2022

0 votes

0 answers

2

Race conditions identification and application of mutex lock
We define a semaphore as follows: typedef struct { int value; struct process *list; } semaphore; Each semaphore has an integer value and a list of processes list. When a process must wait on a semaphore, it is added ... above implementation of wait() and signal(), and illustrate how to resolve the problem using the mutex lock mechanism.

We define a semaphore as follows: typedef struct { int value; struct process *list;} semaphore; Each semaphore has an integer value and a list of processes list. When a p...

Leo0515

263 views

Leo0515 asked Apr 16, 2022

0 votes

0 answers

3

ace academy test series

amitqy

987 views

amitqy asked Nov 21, 2018

0 votes

1 answer

4

self doubt
What is the actual difference between binary semaphore & Mutex????? Are both same thing???? What is the up() code for binary semaphore?????

What is the actual difference between binary semaphore & Mutex????? Are both same thing????What is the up() code for binary semaphore?????

mrinmoyh

681 views

mrinmoyh asked Nov 15, 2018

2 votes

1 answer

5

My doubt
Can a process be preempted while it is in a critical section? If yes, then how does the critical section or synchronisation mechanism concept provide solution for 'Data inconsistency'? If no, then how the gate2013 problem on critical section ... ?v=jDUJsCFNI0E In video explanation instead of preemption sir has used context switch. How preemption is different from context switch?

Can a process be preempted while it is in a critical section?If yes, then how does the critical section or synchronisation mechanism concept provide solution for 'Data in...

Akash Kumar Roy

1.6k views

Akash Kumar Roy asked Mar 30, 2018

5 votes

1 answer

6

Modified gate1997
My question is little different. Each Process Pi, i = 1....9 is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for P10 is identical except it uses V(mutex) in place of P(mutex). What is the ... you can signal semaphore from any other thread (or process), so semaphores are more suitable for some synchronization problems like producer-consumer."

My question is little different.Each Process Pi, i = 1....9 is coded as followsrepeat P(mutex) {Critical section} V(mutex)foreverThe code for P10 is identical ex...

Akash Kumar Roy

1.2k views

Akash Kumar Roy asked Mar 27, 2018

0 votes

0 answers

7

Mutex
Does Mutex provide Bounded Waiting solution ? (since it can lead to deadlock state, and I studied somewhere that if there is deadlock then we cannot assure Bounded Waiting and somewhere I read Mutex provides Bounded Waiting solution).

Does Mutex provide Bounded Waiting solution ? (since it can lead to deadlock state, and I studied somewhere that if there is deadlock then we cannot assure Bounded Wait...

jatinmittal199510

432 views

jatinmittal199510 asked Jan 15, 2017

0 votes

1 answer

8

Virtual Gate Test Series: Operating System - Set Of Process
I don't think any of the options is right. What will be the answer?

I don't think any of the options is right. What will be the answer?

Purple

626 views

Purple asked Jan 13, 2017

0 votes

0 answers

9

Galvin
I was reading operating system book and it is given as follows: "A mutex lock has a boolean variable available whose value indicates if the lock is available or not. The definition of acquire is as follows: acquire() { while (!available) ; /* ... completed execution of acquire) and therefore P1 will not get a chance to execute and therfore deadlock. What am I missing? Please explain.

I was reading operating system book and it is given as follows: "A mutex lock has a boolean variable available whose value indicates if the lock is available or not.The d...

Shivam Chauhan

385 views

Shivam Chauhan asked Dec 14, 2016

6 votes

5 answers

10

GATE Overflow | Operating Systems | Test 1 | Question: 9
Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) forever The code for $P_{10}$ is identical except that it uses $V$ (mutex) instead of $P$ (mutex) and vice ... number of processes that can be inside the critical section at any moment if initial value of the semaphore is 1? 1 2 3 none

Each process $P_i$, where $i= 1$ to $9$ is coded as follows repeat P (mutex) {critical section } V (mutex) foreverThe code for $P_{10}$ is identical except that it uses ...

Bikram

897 views

Bikram asked Sep 3, 2016

5 votes

3 answers

11

Synchronization of two processes using Binary Semaphore_2n_EDITION_HARRIS
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U: Process P: Process Q: P(S) W: P(T) X: P(U) Y: Print ‘a’ Print ‘a’; Print ‘b’ Print &lsquo ... above problem? (a) P(S), P(T) (b) P(T), P(U) (c) P(S), P(U) (d) None

Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U:Process P: Process Q:P(S) ...

Purple

1.8k views

Purple asked Jan 29, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true