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 different tasks of Lexical analysis?
What are the stipulations of C2 level security?
Describe the Buddy system of memory allocation.
What has triggered the need for multitasking in PCs?
To ensure one program doesnt corrupt other program in a Multi program enviornment what you should do?
What are named pipes?
Can we execute any simple program without installing any Operating system?
How to take backup using active directory recyclebin concept
What is an interrupt? How are multiple interrupts dealt with?
What isthe difference between a 'thread' and a 'process'?
What is the best suited algorithm to avoid internal fragmentation?
What is spooling? and What is spooled device? Give the examples for the spooled devices?