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
what is multitask win95
Is go garbage collected?
Can a laptop have both ssd and hdd?
i want information about real time operating systems because i have an interview tomoorow in valeo company.
Which one is the best operating system?
What is Cycle Stealing in OS?
What is the best free operating system?
What is the difference between the OS which you use and other OSs?
What is a Safe State and what is its use in deadlock avoidance?
wha is very first process created by kernel
How many bytes we can send to apple push notification server in iOS operating system?
What is the name of first operating system?
What do you know about the latest android version Lollipop?
What Command To Restore Backup Of Non - Rootvg?
Is 6 cores enough for streaming?
