Answer Posted / sagarika mishra

In computer science, a semaphore is a protected variable or
abstract data type which constitutes the classic method for
restricting access to shared resources such as shared
memory in a multiprogramming environment. A counting
semaphore is a counter for a set of available resources,
rather than a locked/unlocked flag of a single resource. It
was invented by Edsger Dijkstra. Semaphores are the classic
solution to preventing race conditions in the dining
philosophers problem, although they do not prevent resource
deadlocks.
Semaphores can only be accessed using the following
operations. Those marked atomic should not be interrupted
(that is, if the system decides that the "turn is up" for
the program doing this, it shouldn't stop it in the middle
of those instructions) for the reasons explained below.
P(Semaphore s) // Acquire Resource
{
wait until s > 0, then s := s-1;
/* must be atomic because of race conditions */
}

V(Semaphore s) // Release Resource
{
s := s+1; /* must be atomic */
}

Init(Semaphore s, Integer v)
{
s := v;
}

Can I close my computer while updating?

1077

---

Is system restore bad for your computer?

971

---

Do cores matter for gaming?

975

---

What is the difference between concurrency and parallelism?

997

---

Is the g in gnu silent?

932

---

How do I make a pdf file on my laptop?

1073

---

Difference Between Jfs & Jfs2?

1040

---

what are latest technologies ? and how will keep yourself up to date ?

2883

---

What does root mean in computer terms?

1039

---

what is ms configure?

2138

---

What is concurrency go?

1009

---

How do you fix a crashed computer?

987

---

What is the difference between wget and curl?

1155

---

why we make plex offline online in vxvm?

2900

---

What are Odm Commands.

1127

---