Recent questions tagged process-synchronization / GATE Overflow for GATE CSE

1 votes

1 answer

271

Proces Synchronisation
Consider the following algorithm as a solution to the Critical Section problem. The process shares two variables: var flag: array [0 .1] of Boolean; turn= 0 ..1; Initially flag [0]= flag [1]= false; turn= 0 (or) 1; the structure of process Pi is like repeat flag[i ... flag [i]= true & turn= j; (d) flag [i]= false & turn= i; Solution: Option (a) (need the explanation)

Consider the following algorithm as a solution to the Critical Section problem.The process shares two variables:var flag: array [0….1] of Boolean;turn= 0…..1;Initiall...

NIKU

1.2k views

NIKU asked Oct 26, 2017

3 votes

4 answers

272

Process Synchronisation
Consider the below Algorithm: P0: Process= 0 P1: Process= 1 other= 1-Process other= 1-Process while (flag!= Process); while (flag!= Process); Enter CS Enter CS flag= other. flag= other. (a) The ... guarantees Mutual Exclusion (b) The algorithm is busy waiting solution (c) The algorithm does not guarantee progress (d) The algorithm guarantee Bounded waiting

Consider the below Algorithm:P0: Process= 0 P1: Process= 1other= 1-Process ...

NIKU

1.6k views

NIKU asked Oct 26, 2017

2 votes

2 answers

273

Process Synchronisation Of Operating System
Consider the below Algorithm where flag and lock are global variables: P0: P1: while (flag= =1 && lock= = 0); while (flag= = 0 && lock= = 1); Enter CS Enter CS lock= 0 flag= 0 flag= 1 lock= 1 (a) The above algorithm is deadlock free (b) The above algorithm guarantees Mutual Exclusion (c) Both (a) & (b) (d) None of the above

Consider the below Algorithm where flag and lock are global variables:P0: P1:while (fla...

NIKU

1.5k views

NIKU asked Oct 26, 2017

3 votes

1 answer

274

ME,BW,Progress
while(1) { flag[i] = true; while(flag[j]); /* Critical section */ flag[i] = false; /*Remainder section */ } Let flag is declared as Boolean flag[2] and Pi denote one process while Pj denotes other process and i = 1-j. Both ... is satisfied only B) Mutual Exclusion and Bounded Waiting is satisfied only C) Progress is satisfied only D) Mutual Exclusion and Progress is satisfied only

while(1) { flag[i] = true; while(flag[j]); /* Critical section */ flag[i] = false; /*Remainder section */ }Let flag is declared as Boolean flag and Pi denote one process...

Shivam Chauhan

3.3k views

Shivam Chauhan asked Oct 19, 2017

0 votes

1 answer

275

NPTEL
Consider the following statements: i) if(count==0) ii) add %eax,%ebx 1. i is atomic, ii is non-atomic 2. i is non-atomic, ii is non-atomic 3. i is non-atomic, ii is atomic 4. Both are atomic

Consider the following statements:i) if(count==0)ii) add %eax,%ebx1. i is atomic, ii is non-atomic2. i is non-atomic, ii is non-atomic3. i is non-atomic, ii is atomic4...

gulsanchouhan

1.0k views

gulsanchouhan asked Oct 13, 2017

3 votes

2 answers

276

Process Synchronization
Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?

Mutual Exclusion is important for deadlock to happen. Is this statement necessarily true always ?

rishi71662data4

3.3k views

rishi71662data4 asked Oct 11, 2017

1 votes

0 answers

277

process synchronization
I have some doubts : 1. If progress property is satisfied as per the statement (If process does not want to enter the critical section , it should not block others from entering) but there is a possibility of Deadlock as well , then also ... 6. Does freedom from starvation implies bounded wait? I am getting confused , please clarify above doubts with explanation. Thank you.

I have some doubts :1. If progress property is satisfied as per the statement (If process does not want to enter the critical section , it should not block others from en...

ashutosh gaur

1.1k views

ashutosh gaur asked Oct 10, 2017

4 votes

1 answer

278

synchronisation
How to differentiate between deadlock and progress in synchronisation?

How to differentiate between deadlock and progress in synchronisation?

kamakshi

384 views

kamakshi asked Oct 9, 2017

1 votes

1 answer

279

Critical Section
There are two threads which try to solve critical section problem using Test-And-Set instruction. Does the above code prevent deadlock? please provide reason to your answer

There are two threads which try to solve critical section problem using Test-And-Set instruction.Does the above code prevent deadlock? please provide reason to your answe...

Tuhin Dutta

983 views

Tuhin Dutta asked Oct 8, 2017

3 votes

1 answer

280

process synchronization
mutex variable can have value?

mutex variable can have value?

yankur9

477 views

yankur9 asked Oct 7, 2017

0 votes

0 answers

281

MadeEasy Subject Test: Operating System - Process Synchronization
The pic shows the question along with options:

The pic shows the question along with options:

Tuhin Dutta

544 views

Tuhin Dutta asked Oct 2, 2017

1 votes

1 answer

282

MadeEasy Subject Test: Operating System - Process Synchronization

rajoramanoj

542 views

rajoramanoj asked Sep 30, 2017

7 votes

1 answer

283

Livelock and Spinlock
State the difference between livelock and spinlock.

State the difference between livelock and spinlock.

Tuhin Dutta

3.4k views

Tuhin Dutta asked Sep 29, 2017

0 votes

3 answers

284

peterson solution
is bounded waiting satisfy or not?what if turn =other?

is bounded waiting satisfy or not?what if turn =other?

set2018

1.2k views

set2018 asked Sep 24, 2017

2 votes

1 answer

285

process synchronization
1.Does starvation-freedom imply deadlock-freedom? 2. Does starvation-freedom imply bounded-waiting? 3. Does bounded-waiting imply starvation-freedom? 4. Does bounded-waiting AND deadlock-freedom imply starvation-freedom? 5.does no bounded waiting imply starvation?

1.Does starvation-freedom imply deadlock-freedom? 2. Does starvation-freedom imply bounded-waiting?3. Does bounded-waiting imply starvation-freedom?4. Does bounded-waitin...

set2018

1.1k views

set2018 asked Sep 24, 2017

1 votes

2 answers

286

Process Synchronization
Consider Three binary Semaphore Q = R = 1 , S = 0; Process P1:- P(Q); P(R); /* CRITICAL SECTION */ V(Q); V(R); Process P2:- P(R); P(Q); /* CRITICAL SECTION */ V(Q); V(R); Process P3:- P(S); /* CRITICAL SECTION * ... AMOUNT OF TIME then process P2 is also trying to enter into critical section, 1. then Bounded Wait is satisfied or not. 2. then Starvation is satisfied or not.

Consider Three binary Semaphore Q = R = 1 , S = 0; Process P1:- P(Q); P(R); /* CRITICAL SECTION */ V(Q); V(R);Process P2:- P(R); P(Q); /* CRITICAL SECTION */ V(Q); V(R);P...

Shubhanshu

2.5k views

Shubhanshu asked Sep 9, 2017

2 votes

1 answer

287

Concurrent Processes
Consider the program segment: x= 0; y=0; Cobegin begin x= 1; y= y + x; end begin y= 2; x= x + 3; end Coend; Which of the following indicates possible values for the variables when the segment finishes execution? (1) x= 1, y= 2 (2) x= 1, y= 3 (3) x= 4, y= 6 (a) 1 only (b) 1 & 2 only (c) 1 & 3 only (d) 2 & 3 only (e) 1, 2, 3

Consider the program segment:x= 0; y=0;Cobeginbeginx= 1;y= y + x;endbeginy= 2;x= x + 3;endCoend;Which of the following indicates possible values for the variables when th...

ashutoshaay26

1.2k views

ashutoshaay26 asked Sep 3, 2017

3 votes

1 answer

288

Counting Semaphores
2. Assume that ‘C’ is a Counting Semaphore initialized to value ‘10’. Consider the following program segment: P(C); V(C); P(C); P(C); P(C); V(C); V(C) V(C); V(C); V(C); P(C); V(C); V(C); P(C) What is the value of C? a) 8 b)10 c)12 d)14

2. Assume that ‘C’ is a Counting Semaphore initialized to value ‘10’. Consider the followingprogram segment:P(C); V(C); P(C); P(C); P(C); V(C); V(C)V(C); V(C); V(...

ashutoshaay26

4.8k views

ashutoshaay26 asked Sep 3, 2017

0 votes

0 answers

289

2004 gate
A process executes following segment of code: for(i = 1; i <= n; n++) fork(); The number of new process created is 1. n 2. ((n(n+1))/2) 3. (2^n)-1 4. (3^n)-1

A process executes following segment of code:for(i = 1; i <= n; n++)fork();The number of new process created is 1. n2. ((n(n+1))/2)3. (2^n)-14. (3^n)-1

gulsanchouhan

549 views

gulsanchouhan asked Aug 30, 2017

2 votes

2 answers

290

OS:- Synchronzation
1. Progress Satisfied => Deadlock free 2. Starvation free => Deadlock free 3.Starvation freedom => Bounded wait Please explain these implications if valid or invalid

1. Progress Satisfied = Deadlock free2. Starvation free = Deadlock free3.Starvation freedom = Bounded waitPlease explain these implications if valid or invalid

rahul sharma 5

1.4k views

rahul sharma 5 asked Aug 28, 2017

0 votes

1 answer

291

Operation System -> Process Synchronisation -> Counting Semaphores
Struct Semaphore { int value; Queue type L; } Down (Semaphore S) { S.value = S.value -1; if(S.value<0) { put process in L; sleep(); } else return; } Up(Semaphore S) { S.value = S. ... I'm wrong somewhere, please correct me. I referred Tanenbaum and Galvin but didn't find any such explanation for Counting Semaphores)

Struct Semaphore{ int value; Queue type L;} Down (Semaphore S){ S.value = S.value -1; if(S.value<0) { pu...

rakeshgsharma

692 views

rakeshgsharma asked Aug 23, 2017

0 votes

1 answer

292

bounded waiting, deadlock and starvation free
i know these questions has been asked many times...but nowhere i get an appropriate answer... 1- does no bounded waiting implies starvation free or vice versa ? 2- does deadlock implies starvation or vice versa ? please provide some genuine reason, if some authentic link available then it would be more helpful..

i know these questions has been asked many times...but nowhere i get an appropriate answer...1- does no bounded waiting implies starvation free or vice versa ?2- does dea...

vamp_vaibhav

621 views

vamp_vaibhav asked Aug 21, 2017

4 votes

1 answer

293

Process Synchronization: Dekker's algorithm
This Screenshot is taken from William Stalling's Operating Systems book. My doubt is that Bounded wait is not satisfied by this solution. Though Book claims that is satisifes all three required conditions. For example: P0 and P1 both want to enter ... its flag to False to give path to Po and now stuck for infinite time. hence B.W is not satisfied!

This Screenshot is taken from William Stalling's Operating Systems book. My doubt is that Bounded wait is not satisfied by this solution. Though Book claims that is satis...

Manu Thakur

3.8k views

Manu Thakur asked Aug 21, 2017

3 votes

1 answer

294

process synchronization
What is SPIN-LOCK..?

What is SPIN-LOCK..?

vishalshrm539

678 views

vishalshrm539 asked Aug 17, 2017

1 votes

2 answers

295

GATE 2009 33
Is Spin Lock in TSL a kind of a deadlock? Or we can not consider it a deadlock at all?

Is Spin Lock in TSL a kind of a deadlock? Or we can not consider it a deadlock at all?

Parimal Paritosh

498 views

Parimal Paritosh asked Aug 2, 2017

3 votes

1 answer

296

Producer Consumer Problem
Consider the producer-consumer problem solution using semaphore. Which of the following condition below synchronization mechanism satisfies. Mutual Exclusion Bounded Waiting Progress Architecural Neutral mutex buffer_mutex; // similar to "semaphore buffer_mutex = ... buffer_mutex); item = removeItemFromBuffer(); up(buffer_mutex); up(emptyCount); consumeItem(item); } }

Consider the producer-consumer problem solution using semaphore. Which of the following condition below synchronization mechanism satisfies. Mutual Exclusion Bounded Wait...

Durgesh Singh

2.6k views

Durgesh Singh asked Jul 22, 2017

1 votes

0 answers

297

operating system

set2018

3.6k views

set2018 asked Jul 12, 2017

1 votes

1 answer

298

process synchronization
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = false; ... flag[j] = true and turn = j 3)flag[i] = true and turn = j 4)flag[i] = true and turn = i

Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.repeat flag[i] = true; t...

set2018

863 views

set2018 asked Jul 12, 2017

0 votes

1 answer

299

Test by Bikram | Mock GATE | Test 4 | Question: 32
$A\left [ 0 \right ] \dots A\left [ 4 \right ]$ is an array of mutexes (binary semaphores) and $B\left [ 0 \right ] \dots B\left [ 4 \right ]$ is an array of processes. If each process $B\left [ i \right ]$ ... .... release (A[i]); release (A[(i+1)mod4]); This could result in __________. Thrashing Progress Starvation, but not deadlock. Deadlock

$A\left [ 0 \right ] \dots A\left [ 4 \right ]$ is an array of mutexes (binary semaphores) and $B\left [ 0 \right ] \dots B\left [ 4 \right ]$ is an array of processes.I...

Bikram

275 views

Bikram asked May 14, 2017

6 votes

4 answers

300

ISRO2017-68
A critical region is a piece of code which only one process executes at a time is a region prone to deadlock is a piece of code which only a finite number of processes execute is found only in windows NT operating system

A critical regionis a piece of code which only one process executes at a timeis a region prone to deadlockis a piece of code which only a finite number of processes execu...

sh!va

5.5k views

sh!va asked May 7, 2017

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