Interested to Buy Any Domain ? << Click Here >> for more details...
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 the cpu scheduler?
What is system bus? Explain a few related terms.
Do I need 32gb of ram?
Differentiate between Multiprocessing, Mutliprogramming and Multithreading.
What is time- sharing system?
Does direct memory manipulation is an unsafe operations, if yes, how?
Can I change operating systems on my laptop?
What are merits and demerits of systems supporting multiple file structure and systems supporting a stream of bytes?
How do I find my hidden files?
Does chkdsk delete files?
What is the sequence of the three way handshake?
How can I tell what programs are running in the background on my computer?
Can you move your program files to another drive?
Explain the Difference between Process and a Thread.
Page replacement algorithm in Operating System?
