Dark Mode

Recent questions tagged critical-section

0 votes

2 answers

1

process synchronization
Which of the following statements is false? a) Disjoint processes need not use critical section b) Programs with critical sections can never be use simultaneously by more than one process c) A process wanting to enter the critical section currently ... to terminate d) Two different critical sections may be executed concurrently if they do not use the same shared variables

practicalmetal asked in Operating System Apr 18

by practicalmetal

114 views

1 vote

1 answer

2

GO Classes 2023 | IIITH Mock Test 2 | Question: 75
Consider the following pseudo-code for a process $\textsf{Pi},$ where $\textsf{ shared boolean flag[2] }$ is a variable declared in shared memory, initialized as: flag[0] = flag[1] = FALSE; P(int i) { // ... Which of the following is/are true? Deadlock is possible. Mutual exclusion is satisfied. Bounded waiting is satisfied. Progress is satisfied.

GO Classes asked in Operating System Apr 8

175 views

4 votes

0 answers

3

made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.

atulcse asked in Operating System Jan 19, 2022

476 views

0 votes

0 answers

4

Ace test series: Operating System - Critical Data Minimum Value
Consider the following program segments for two different processes (P1, P2) executing concurrently and where a and b are not shared variables, but x starts at zero and is a shared variable Processor #1 Processor #2 for (a = 1; ... + 1; If P1 and P2 execute only once and concurrently, then the final minimum possible value of x is ____

OneZero asked in Operating System Jan 15, 2019

499 views

0 votes

0 answers

5

Relating process termination and deadlock with progress requirement of the solution to the critical section problem

Raj Singh 1 asked in Operating System Jan 1, 2019

1.0k views

1 vote

1 answer

6

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

Raj Singh 1 asked in Operating System Jan 1, 2019

1.4k views

0 votes

0 answers

7

Process Synchronization
Does Progress implies freedom from Deadlock?

Nirmal Gaur asked in Operating System Dec 19, 2018

362 views

0 votes

1 answer

8

Deadlock condition in synchronization
Please describe the Deadlock Condition in synchronization and when will be synchronization possible and condition ..?

Rackson asked in Operating System Dec 14, 2018

318 views

1 vote

2 answers

9

synchronization
does it guarantee mutual exclusion and deadlock prevention?

Rahul_Rathod_ asked in Operating System Dec 12, 2018

by Rahul_Rathod_

558 views

0 votes

0 answers

10

previous
https://gateoverflow.in/1319/gate2009-33 In this question progress is present or not? According to me making x=0 is exit part and not the reminder part. Hence I think progress is there. Am I correct? Definition : If no process is ... in their remainder sections can participate in deciding which will enter its critical section next, and this selection cannot be postponed indefinitely.

Swapnil Naik asked in Operating System Nov 14, 2018

by Swapnil Naik

168 views

0 votes

1 answer

11

Made Easy Test Series:OS
Consider the following solution for critical section problem with 'n' processes P0,P1,P2,......P(n-1).For all i,number[i] is an integer array initialized to zero, and for all j,choosing[j] is a binary array initialized to false. CODE FOR Pi : Repeat { ... only. b)S1 and S2 only. c)S2 and S3 only. d)S1 , S2 and S3 (please anyone elaborate this solution.thanks in advance)

talha hashim asked in Operating System Oct 18, 2018

by talha hashim

462 views

4 votes

3 answers

12

Critical Section
Consider the following code to solve the critical section problem for two processes P0 and P1. Initially flag [i] contain false for i = 0 and 1. Assume i refers to the current process Pi and j refers the other process Pj. If two processes ... following satisfy the above solution? A. Mutual exclusion and progress B. Mutual exclusion and bounded wait C. Progress D. None of these

Na462 asked in Operating System Jul 18, 2018

by Na462

3.7k views

0 votes

0 answers

13

My doubt on critical section
Is context switch allowed when a process is in the cirtical section? (Not preemption) If yes then how it deals with data inconsistency?

Akash Kumar Roy asked in Operating System Mar 31, 2018

by Akash Kumar Roy

210 views

2 votes

1 answer

14

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 is ... watch?v=jDUJsCFNI0E In video explanation instead of preemption sir has used context switch. How preemption is different from context switch?

Akash Kumar Roy asked in Operating System Mar 30, 2018

by Akash Kumar Roy

1.3k views

1 vote

1 answer

15

made easy tests
Q1. Consider the methods used by process P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared Boolean variables, S1 and S2 are random assigned. For the program to guarantee mutual exclusion, the predicate P and ... My doubt is what is the case in which option D will not satisfy mutual exclusion? I am confused between B and D.

mahakp asked in Operating System Jan 5, 2018

by mahakp

1.4k views

3 votes

0 answers

16

OS critical section
Let 'n' processes competing to enter their critical sections and mutex be a global binary semaphore initialized to 1. The process is coded as follows: Signal(mutex); C.S; wait(mutex); Which of the following statements are TRUE? s1: This code ... decision is not postponed indefinitely and there is no competition to enter as well. can we take this as progress? Please answer.

junk_mayavi asked in Operating System Jan 2, 2018

543 views

0 votes

1 answer

17

Problem regarding mutual exclusion
Process P1 Process P2 P(S1) P(S1) P(S2) P(S2) Critical Section Critical Section V(S2) V(S1) V(S1) V(S2) In one of the Gateoverflow tests, this question was given and it was told that in the above case mutual exclusion is not ... section. As far as the order of unlocking, I dont see a problem there. Can someone please explain why mutual exclusion is not guaranteed?

humblefool asked in Operating System Dec 14, 2017

693 views

1 vote

0 answers

18

Deadlock implies No Progress (in process synchronization) ?
Hi Guys, Deadlock implies no progress. This statement is mentioned at many places. But i just want to verify my reasoning with respect to Progress definition Progress If no process is executing in its critical section and some ... of Deadlock. If my reasoning is not complete or incorrect then please notify. It will be a great help.

Chhotu asked in Operating System Dec 4, 2017

by Chhotu

671 views

2 votes

2 answers

19

Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s> }while(1); the code for the n-th process i.e Pn is given by do{ signal(S); <c.s> signal(S); < ... (1); What is the max no. of processes that can be there in the critical section simultaneously? A. 2 B . 3 C. n-1 D. n

Kalpataru Bose asked in Operating System Nov 27, 2017

by Kalpataru Bose

631 views

2 votes

2 answers

20

Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n-1) processes have the code do{ wait(S); <c.s> signal(s); <r.s>}while(1); the code for the n-th process i.e Pn is given by do{ signal(S); <c.s> wait(S); <r. ... ; a) What is the max no. of processes that can be there in the critical section simultaneosly ? A. 2 B . 3 C. n-1 D. n

Kalpataru Bose asked in Operating System Nov 27, 2017

by Kalpataru Bose

535 views

1 vote

1 answer

21

critical section
Consider the following code to access critical section do{ flag[j] = 1; turn = x; while(y); // Critical Section flag[z]=0; // Remainder Section } while(1); The values of x, y and z in the above code for which Mutual exclusion is guaranteed for two process i and j x=j; y=flag[j] ... =flag[i]&&turn=i; z=j x=j; y=flag[i]&&turn=i; z=j x=j; y=flag[j]&&turn=j; z=j

Parshu gate asked in Operating System Nov 27, 2017

2.8k views

0 votes

1 answer

22

Process Synchronization
In a given synchronization construct, if there is no deadlock and no strict alternation between two process then is it always true that a process will starve ?

rishi71662data4 asked in Operating System Nov 16, 2017

by rishi71662data4

493 views

3 votes

0 answers

23

critical sections conceptual
Consider the following two-process synchronization solution. Process 0 --------- Entry: loop while (turn == 1); (critical section) Exit: turn = 1; Process 1 ---------- Entry: loop while (turn == 0); (critical ... (B) This solution violates mutual exclusion requirement. (C) This solution violates progress requirement. (D) This solution violates bounded wait requirement.

Parshu gate asked in Operating System Nov 13, 2017

498 views

2 votes

0 answers

24

Self Doubt on software and hardware solution to critical section problem
Please verify whether the given table in the picture is correct or not?

Tuhin Dutta asked in Operating System Nov 13, 2017

680 views

1 vote

1 answer

25

Process Synchronization
which of the following is true? it guarantees mutual exclusion. it is busy waiting solution. it does not guarantees progress. it guarantee bounded waiting. entry_section(int process) { int other = 1-process while (flag!=process); CS } exit_section(int process) { flag = other }

hacker16 asked in Operating System Nov 9, 2017

609 views

1 vote

1 answer

26

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

Tuhin Dutta asked in Operating System Oct 8, 2017

694 views

3 votes

1 answer

27

process synchronization
mutex variable can have value?

yankur9 asked in Operating System Oct 7, 2017

349 views

Page:

Recent questions tagged critical-section