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
Briefly explain thrashing.
What is monolithic kernel?
Is vmware a hypervisor?
How do I get the ie tab in chrome?
What is the difference between 32 bit and 64 bit os?
Can ram cause blue screen?
Which vpn protocol is best?
What is Real Time Operating System (RTOS)? What are the advantages of RTOS?
How do I tell if excel 2016 is 32 or 64 bit?
Explain a system in safe state?
How much ram do I need for excel?
Tell me when does the condition 'rendezvous' arise?
Can I install 64 bit on x86?
What's the difference between 32 and 64 bit?
What is the full form of os?