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
Does ram affect excel performance?
What are the 5 basic filing systems?
What is throughput?
Draw the states of a process in an OS.
How do I make a bootable usb drive?
Give an example of Priority Inversion in Scheduling. What are the consequences of Priority Inversion?
Can I install 64 bit on x86?
Why paging is used in os?
Explain an idle thread?
What is the max ram for a 64 bit?
What is context in operating system?
What do you know about interrupt?
Explain the concept of the multi-processor systems or parallel systems?
What is the major difference between Thread.start() & Thread?run() method?
What are the pros and cons of using circuit switching?
