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
Is it possible to have a deadlock involving only one process?
How can I tell if a program is 64 bit?
What is the purpose of system calls?
Do 32 bit programs run faster on 64bit?
What is an operating system on a computer?
Can you list the coffman's conditions that lead to a deadlock?
What is starvation and aging?
How do I make a bootable usb drive?
What is scsi?
How do I upgrade my excel to 64 bit?
What is sock_seqpacket?
How does swapping result in better memory management?
Why interprocess communication is required?
What are the different states of a process?
Name the functions constituting the os's memory management.
