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;
}
| Is This Answer Correct ? | 29 Yes | 12 No |
Post New Answer View All Answers
How do you start up a computer?
What is microsoft spreadsheet compare?
What is concurrency go?
What is the latest version of google browser?
What does the g in gnu stand for?
How To Lock A User's Account?
Can I factory reset my laptop without a recovery disc?
Can I restore my computer to yesterday?
What is the g in gnu?
What is difference between post and patch?
How many os are there?
How do I compare plugins in notepad ++?
What is a Kernel?
What is the best memory for a laptop?
what is memory managemant in Win95
