Avoidance of mutual exclusion

prathams asked Jan 25, 2016

484 views

0 votes

which of the following is the guaranteed solution of avoidance of mutual exclusion?

1. Semaphore

2. Monitor

3. Bankers Algorithm

4. None

Operating System
operating-system

+ –

prathams asked Jan 25, 2016

prathams

484 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

Monitor bcoz bankers is deadlock avoidance technique and if semaphore is used in the wrong way it could violate mutual exclusion condition so ans is monitor

Amey answered Jan 25, 2016

Amey

See all

1 1 comment

prathams

commented Jan 26, 2016

But monitor is used for achieving mutual exclusion, then how come it is avoiding mutual exclusion ?

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

2 answers

sh!va asked Dec 3, 2016

596 views

Predict Mutual exclusion and progress of given code
Consider the methods used by processes PI and P2 for accessing their critical sections. The initial values of shared Boolean variables S, and S2 are randomly assigned, P1 while (SI = = S2); critical section S1= S2; P2 while ... (B) Progress but not mutual exclusion (C) Neither mutual exclusion nor progress (D) Both mutual exclusion and progress

Consider the methods used by processes PI and P2 for accessing their critical sections.The initial values of shared Boolean variables S, and S2 are randomly assigned,P1wh...

sh!va

596 views

sh!va asked Dec 3, 2016

Operating System
deadlock-prevention-avoidance-detection
operating-system

+ –

0 votes

2 answers

shivajikobardan asked Jul 22, 2023

823 views

What's the standard technique to test if the algorithm satisfies mutual exclusion, progress and bounded waiting or not?

Sorry if this is a stupid question. But it really intrigued me. Same resources at different algorithms are telling different ways to test these stuffs.Here's an algorith...

shivajikobardan

823 views

shivajikobardan asked Jul 22, 2023

Operating System
operating-system
deadlock-prevention-avoidance-detection
process-synchronization
critical-section
mutual-exclusion

+ –

1 votes

1 answer

Raj Singh 1 asked Jan 1, 2019

2,079 views

Deciding if mutual exclusion and progress is satisfied
Consider the following Process Pi while(1) { while(turn != i); //critical section turn = j; //remainder section } Process Pj while(1) { while(turn != j); //critical section turn = I; //remainder ... & progress are not satisfied Only mutual exclusion is satisfied Only progress is satisfied Both mutual exclusion and progress are satisfied

Consider the followingProcess Piwhile(1){ while(turn != i); //critical section turn = j; //remainder section}Process Pjwhile(1){ while(turn != j); //critical ...

Raj Singh 1

2.1k views

Raj Singh 1 asked Jan 1, 2019

Operating System
critical-section
mutual-exclusion
operating-system

+ –

0 votes

1 answer

the_bob asked Sep 25, 2018

1,004 views

Mutual Exclusion vs. Hold and Wait
In the context of a Deadlock, what is the difference between Mutual Exclusion and Hold and Wait ? In case of Hold and Wait, a process holds atleast one resource. Doesn't this correspond to Mutual Exclusion, where atleast one resource is held in a non-shareable mode ??

In the context of a Deadlock, what is the difference between Mutual Exclusion and Hold and Wait ?In case of Hold and Wait, a process holds atleast one resource. Doesn't t...

the_bob

1.0k views

the_bob asked Sep 25, 2018

Operating System
operating-system
deadlock-prevention-avoidance-detection

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

0

1 1 comment