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 a safe state and a safe sequence?
What is authentication in operating system?
What do you mean by a process?
How do I search for a file?
What is an OS? Explain it to a layman.
What are old chkdsk files?
How many gb of ram can 64 bit use?
Is 64 bit excel faster?
What are advantages of operating system?
How to take backup using active directory recyclebin concept
What is the use of Synchronized keyword?
What is memory-management unit (mmu)?
What is the programs x86 folder?
Do I need program files and program files x86?
What are the functions of operating system?
