Linked by Elad Lahav on Thu 18th Feb 2016 19:27 UTC

A mutex is a common type of lock used to serialize concurrent access by multiple threads to shared resources. While support for POSIX mutexes in the QNX Neutrino Realtime OS dates back to the early days of the system, this area of the code has seen considerable changes in the last couple of years.

Permalink for comment 625017
To read all comments associated with this story, please click here.
RE[4]: Mutex behavior
by Alfman on Fri 19th Feb 2016 16:58 UTC in reply to "RE[3]: Mutex behavior"
Member since:


1. Any thread can signal the semaphore, leading to a loss of mutual exclusion (which will go unnoticed until data corruption is observed).

Notice in the link I provided earlier that the pthread mutex behavior is undefined for the conditions where one would try to signal from another thread. It means that no code which correctly uses the mutex is allowed to attempt to signal the mutex from another thread. The fact that the semaphore defines and/or behaves differently for those conditions doesn't make it any less suitable as a mutex in code which makes no assumptions about those conditions. For all conditions that are defined for the mutex, the semaphore works the same way.

In other words, I think the semaphore pseudocode I gave above would be a valid implementation of a pthread mutex.

Note that I agree with you that a mutex is generally the accepted mechanism to use to serialize access to a data structure, but I'm not able to come up with examples where a semaphore doesn't work...can you come up with any counter examples?

2. No way to avoid priority inversion.

Even with a mutex, a low priority thread can block a high priority thread. Am I misunderstanding you?

Edited 2016-02-19 17:03 UTC

Reply Parent Score: 2