Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / swetcha
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
deallocate.
| Is This Answer Correct ? | 11 Yes | 5 No |
Post New Answer View All Answers
What is bursting?
Will chkdsk delete my files?
What is dual-mode operation?
What is the difference between logical address space and physical address space?
Briefly explain FCFS.
What does the 400 mhz signify in a ram specification?
What are the different types of semaphores?
How much ram can you put in a 64 bit system?
What are the various components of a computer system?
What is purpose of different operating systems?
What is a 64 bit application?
What is a job queue?
How long does it take to run chkdsk?
How do I find my hidden files?
Is sae same as af?
