Recent questions tagged critical-section

For a correct mechanism controlling entry into a critical section, consider the following requirements:Two processes must not execute simultaneously inside their critical...

Which of the following statements are CORRECT ?A process always check state of currently executing process to enter critical schema.Spin locks uses busy waiting.Periodica...

I have a question.If there is a hypothetical cs solution.In it 3 processes are waiting .whoever will get cpu will enter into the cs.Can that be called starvation?

Consider an operating system consisting of a pair of processes $P_{0}$ and $P_{1}$. The structure of each process $P_{\mathrm{i}}$ is shown below.while(TRUE){ j = 1-i; fl...

How to approach synchronization (specifically semaphore) question, there size are really intimidating and i’m unable to decode the code written? What to do??

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...

In design protocol of critical section problem, each process must ask permission to enter critical section in ________ code; it then executes in the critical section; onc...

Which of the following statements is false?a) Disjoint processes need not use critical sectionb) Programs with critical sections can never be use simultaneously by more t...

Consider the following pseudo‐code for a process $\textsf{Pi},$ where $\textsf{“shared boolean flag ”}$ is a variable declared in shared memory, initialized as:flag[0] = ...

Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:SemaphoresDirectoryCritical sectionMutual exclusion

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

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

does it guarantee mutual exclusion and deadlock prevention?

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...

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 cur...

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...

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, ...