Answers were Sorted based on User's Feedback
Counting semaphore -Locks a shared resource against
simultaneous access by multiple threads
A counting semaphore is a generalization of a mutex
semaphore that locks a shared resource against simultaneous
access by multiple threads. All resource allocation
functions, such as wait() and post() , take an optional
parameter defining the number of resources to allocate or
|Is This Answer Correct ?||11 Yes||5 No|
Answer / kiruthiga
Semaphore is a nonnegative integer count. Semaphores are
typically used to coordinate access to resources, with the
semaphore count initialized to the number of free
resources. Threads then atomically increment the count when
resources are added and atomically decrement the count when
resources are removed.
When the semaphore count becomes zero, no more resources
are present. Threads that try to decrement the semaphore
when the count is zero block until the count becomes
greater than zero.
|Is This Answer Correct ?||7 Yes||4 No|
Answer / arshiya
Counting semaphores are a synchronization primitive that
allow threads to wait until an event has occurred. The event
may be generated by a producer thread, or by a DSR in
response to a hardware interrupt.
|Is This Answer Correct ?||8 Yes||8 No|
Answer / nagi
Binary semaphore or mutex is used for single resouce
locking.where as counting semaphone is a variable counter
whose value will be initilised to number of resources
present.one can acees the resource if semaphore value is
greater than zero.
|Is This Answer Correct ?||0 Yes||0 No|
What are the four layers that Windows NT have in order to achieve independence?
What are your solution strategies for "Dining Philosophers Problem" ?
What is page cannibalizing?
What are the problems can stack based management in recursive calling of functions?
What is Concurrency? Expain with example Deadlock and Starvation?
Explain about Operating System Security?
List out some reasons for process termination.
When the process is hung...what the immediate solution you will give?
What is Thrashing?
What are the key object oriented concepts used by Windows NT?
In the context of memory management, what are placement and replacement algorithms?