Recent questions tagged semaphore

Consider an integer semaphore $\texttt{S}$.Method $\textbf{1}$wait(S): disable interrupts while S <= 0: do nothing S = S - 1 enable interrupts signal(S): disable interrup...

A bounded buffer has capacity $6$ and is initially empty.The semaphore values are initially:$\texttt{empty} = 6$$\texttt{full} = 0$$\texttt{mutex} = 1$During execution:$9...

A bounded buffer has capacity $5$ and is initially empty.During an execution:$8$ producer insertions complete. $5$ consumer removals complete.Assume no insertion or remov...

A producer-consumer system uses a buffer containing $N$ slots.The semaphores are:$\texttt{empty}$, representing empty slots $\texttt{full}$, representing filled slots $\t...

Which of the following statements are correct?Semaphore $\texttt{wait()}$ and $\texttt{signal()}$ operations must be atomic. A counting semaphore can represent the number...

A semaphore $S$ is initialized to $1$.The following operations occur in order:$\texttt{wait(S)}$$\texttt{wait(S)}$$\texttt{signal(S)}$$\texttt{wait(S)}$$\texttt{signal(S)...

Two concurrent processes execute:Process A$A_1$$A_2$$A_3$$A_4$Process B$B_1$$B_2$$B_3$$B_4$A semaphore $S$ is initialized to $0$.The requirement is that $A_2$ must comple...

Consider three processes $\text{P1, P2}$, and $\text{P3}$ running identical code, as shown in the pseudocode below. $\text{A}$ and $\text{B}$ are two binary semaphores in...

What is the value of n after 10 concurrent threads terminate, where initially value of counting semaphore s = 2 and n=0?Thread Tk:int x;wait(s);x = n;n = x + 1;signal(s);...

Consider the following three threads and four semaphores.$s 1, s 2, s 3, s 4$ are counting semaphores and $x$ is a shared variable initialized as $1.$The goal is to initi...

Consider the following three threads and four semaphores.$s 1, s 2, s 3, s 4$ are counting semaphores and $x$ is a shared variable initialized as $1.$The goal is to initi...

can someone please explain the exact difference between binary semaphores and mutex?not able to find any simple explanation.

Let $P_{1}, P_{2}, \ldots, P_{20}$ be a set of 20 cooperating processes, all of which have access to a shared integer X. For $i \in\{1,2, \ldots, 20\}$, the process $P_{i...