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 virtual memory and where it exhist ?
What are different types of interprocess communication methods?
What are types of operating system?
What is basic concept of operating system?
What are device drivers in os?
What do you understand by registers?
Is faster ram worth it?
Explain the concept of Thread Pool? what its Benefits?
What is the purpose of system calls?
Do I need web plugins for vlc?
Explain Advantages and Limitations of a command line interface?
How much ram can you have on a 64 bit system?
What are the steps of booting?
What are the disadvantages of microkernels?
What are the three types of file system?
