Answer Posted / sri
In programming, especially in Unix systems, semaphores are a
technique for coordinating or synchronizing activities in
which multiple processes compete for the same operating
system resources. A semaphore is a value in a designated
place in operating system (or kernel) storage that each
process can check and then change. Depending on the value
that is found, the process can use the resource or will find
that it is already in use and must wait for some period
before trying again. Semaphores can be binary (0 or 1) or
can have additional values. Typically, a process using
semaphores checks the value and then, if it using the
resource, changes the value to reflect this so that
subsequent semaphore users will know to wait.
Semaphores are commonly use for two purposes: to share a
common memory space and to share access to files. Semaphores
are one of the techniques for interprocess communication
(IPC). The C programming language provides a set of
interfaces or "functions" for managing semaphores.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
In the token-passing mutual exclusion algorithm, is the timestamping used to reset clocks and correct drifts, as in the distributed queue algorithms? if not, what is the function of the timestamping?
Does a disk cleanup delete everything?
How To Convert A Normal Vg To Big & Scalable Vg And Also Big To Scalable Vg?
How do you fix a computer that won't start up?
Why does kernel panic occur?
Who started gnu?
How can I increase storage on my laptop?
Can I install chrome os on my laptop?
What causes a corrupt operating system?
What is difference between kernel and os?
How do you pronounce gnu?
Can I restore my computer to yesterday?
How do I compare plugins in notepad ++?
What is the best os for laptop?
Can yum install rpm?