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 different tasks of lexical analysis?
What is real time operating systems?
What are the 3 types of filing systems?
Define the difference between preemptive and nonpreemptive scheduling.
Why is ram also known as volatile memory?
Define page fault interrupt?
What is micro kernel approach and site its advantages?
When does page fault error occur?
What is the main thread?
What do you mean by a zombie process?
What are the different types of fragmentation?
What are differences between ram and rom?
What are the 3 types of operating systems?
What is synchronization? What are the different synchronization mechanisms?
What is difference between deadlock and starvation?