linux线程之厕所理论Mutex、Semaph…

Mutex:

is a key to a toilet. One person can have the key - occupy the toilet -at the time. When finished, the person gives(frees)the key to the next person in the queue. Officially:"Mutexes are typically used to serialise access to a section of re-entrant code that cannot be executed concurrently by more than one thread. A mutex object only allows one thread into a controlled section , forcing other threads which attempt to gain access to that section to wait until the first thread has exited from that section."

Semaphore:

is the number of free identical toilet keys.Example,say we have four toilets with identical locks and keys. The semaphore count - the count of keys - is the count value is decremented as people are coming in.If all toilets are full. there are no free keys left, the semaphore count is 0.NOw,when one person leaves the toilet, semaphore is increased to 1(one free key),and given to the next person in the queue.Officially:"A semaphore restricts the number of simultaneous users of a shared resource up to a maximum number.Threads can request access to the resource (decrementing the semaphore),and can singnal that they have finished using the resource (incrementing the semaphore)."