Difference between binary semaphore and mutex

by

They are NOT the same thing. They are used for different purposes!
While both types of semaphores have a full/empty state and use the same API, their usage is very different.

Mutual Exclusion Semaphores
Mutual Exclusion semaphores are used to protect shared resources (data structure, file, etc..).

A Mutex semaphore is “owned” by the task that takes it. If Task B attempts to semGive a mutex currently held by Task A, Task B’s call will return an error and fail.

Mutexes always use the following sequence: 

  - SemTake
  - Critical Section
  - SemGive

Here is a simple example:

  Thread A                     Thread B
   Take Mutex
     access data
     ...                        Take Mutex  <== Will block
     ...
   Give Mutex                     access data  <== Unblocks
                                  ...
                                Give Mutex

Binary Semaphore
Binary Semaphore address a totally different question:

  • Task B is pended waiting for something to happen (a sensor being tripped for example).
  • Sensor Trips and an Interrupt Service Routine runs. It needs to notify a task of the trip.
  • Task B should run and take appropriate actions for the sensor trip. Then go back to waiting.

   Task A                      Task B
   ...                         Take BinSemaphore   <== wait for something
   Do Something Noteworthy
   Give BinSemaphore           do something    <== unblocks

Note that with a binary semaphore, it is OK for B to take the semaphore and A to give it.
Again, a binary semaphore is NOT protecting a resource from access. The act of Giving and Taking a semaphore are fundamentally decoupled.
It typically makes little sense for the same task to so a give and a take on the same binary semaphore.

More Related Contents:

  1. Implementing an N process barrier using semaphores
  2. Which is better segmentation with paging or paging?
  3. What is the difference between lock, mutex and semaphore?
  4. What are some resources for getting started in operating system development? [closed]
  5. How can I tell if another instance of my program is already running?
  6. When should we use mutex and when should we use semaphore
  7. Is there a Mutex in Java?
  8. Is it possible to use mutex in multiprocessing case on Linux/UNIX ?
  9. What are Ring 0 and Ring 3 in the context of operating systems?
  10. What is mutex and semaphore in Java ? What is the main difference?
  11. Historical reason behind different line ending at different platforms
  12. Conditional Variable vs Semaphore
  13. When is a condition variable needed, isn’t a mutex enough?
  14. How to load second stage boot loader from first stage?
  15. Why an executable program for a specific CPU does not work on Linux and Windows?
  16. What is the difference between user and kernel modes in operating systems?
  17. Which is more efficient, basic mutex lock or atomic integer?
  18. how do i add a system call / utility in xv6
  19. What does fflush(stdin) do in C programing? [duplicate]
  20. detecting operating system in R (e.g. for adaptive .Rprofile files)
  21. PHP mutual exclusion (mutex)
  22. How is the system call in Linux implemented?
  23. “The semaphore timeout period has expired” error for USB connection
  24. If I am using channels properly should I need to use mutexes?
  25. Map with concurrent access
  26. What is the difference between Trap and Interrupt?
  27. Is it possible to use threads to speed up file reading?
  28. Virtually indexed physically tagged cache Synonym
  29. How do I recover a semaphore when the process that decremented it to zero crashes?
  30. Understanding Ruby and OS I/O buffering

Leave a Comment