Recent questions tagged process-synchronization

Your friend wants to design synchronization primitives and tells you that he would be better off by strictly ensuring that the processes alternate the critical section. Y...

Given below are two statements: one is labelled as Assertion $\text{A}$ and the other is labelled as Reason $\text{R}$.Assertion $\text{A}$: A process involves a library ...

At a particular time of computation, the value of a counting semaphore is $7$. Then $20 \mathrm{p}$ operations and ' $\mathrm{x}$ ' $\mathrm{V}$ operations were completed...

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

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first serv...

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

Match $\text{List I}$ with $\text{List II}$$\text{List I}$$\text{List II}$$\text{A}$. IPC$\text{I}$. Resource Allocation$\text{B}$. Demand Paging$\text{II}$. Computationa...

Consider the following multi threaded code.volatile static int flag1= 0, flag2= 0; // code for thread 1 (or T1) flag1 = 1; if (flag2==0) code1(); // end of code for T1 //...

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

Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...

Consider the following task graph and given task lengths (in time units). The unspecified $x$ and $y$ are non-negative numbers.Each edge $\mathrm{Ti} \rightarrow \mathrm{...

Since Dealock No Progressthen Does Progess No Deadlockbcoz contrapositive should be true.