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 are differences between ram and rom?
What is starvation and aging?
What are the two types of file system?
What is a binary semaphore?
What is the difference between internal commands and external commands?
Explain the concept of deadlocks? Why they are used?
What are necessary conditions for dead lock?
What are the advantages of multithreaded programming?
What is virtual memory and where it exhist ?
What are the 5 stages of chkdsk?
Explain briefly what is meant by trap and a trapdoor?
Can ram affect fps?
Can I have two operating systems on one computer?
What are dynamic linking?
What is a layered approach and what is its advantage?
