Also found in: Dictionary, Thesaurus, Medical, Legal, Financial, Acronyms.
Related to mutex: semaphore, Mutex lock


(tool, music)
An extension of TeX for typesetting music.


A mutual exclusion object that allows multiple threads to synchronise access to a shared resource. A mutex has two states: locked and unlocked. Once a mutex has been locked by a thread, other threads attempting to lock it will block. When the locking thread unlocks (releases) the mutex, one of the blocked threads will acquire (lock) it and proceed.

If multiple threads or tasks are blocked on a locked mutex object, the one to take it and proceed when it becomes available is determined by some type of scheduling algorithm. For example, in a priority based system, the highest priority blocked task will acquire the mutex and proceed. Another common set-up is put blocked tasks on a first-in-first-out queue.

See also: priority inversion


(1) (MUTually EXclusive) A programming flag used to grab and release an object. When data are acquired that cannot be shared or processing is started that cannot be performed simultaneously elsewhere in the system, the mutex is set to "lock," which blocks other attempts to use it. The mutex is set to "unlock" when the data are no longer needed or the routine is finished. See flag.

(2) (MUsic TEX) A package of macros for the TeX typesetting system that supports musical notation.
References in periodicals archive ?
carrier: The process that has locked the mutex RT-Semaphore.
Note that without preconditioning, GMRES(50) converges only for the mutex matrices.
For the Mutex example, the local transition matrices are full.
A stronger interpretation and computation of mutex propagation takes place in the previously mentioned serial planning graphs, which remove all notion of action parallelism by forcing each action to be mutex with every other action (except for hoop actions).
extern double interact (double, double); class body { private: lock mutex; double pos, sum; public: void one_interaction (body *b); void interactions(body b[], int n); }; void body::one_interaction(body *b) { double val = interact(this->pos, b->pos); sum = sum + val; } void body::interactions(body b[], int n) { mutex.
A channel is also called reliable if it is a linear, replicated input, or mutex channel.
The compiler also augments each node object with a mutual exclusion lock mutex.
mutex, which appears in the event Conds, is provided by the knowledge base and is used for automating properties checking when faul detection and localization procedure is carried out.
The same rules as the ones for computing GRAPHPLAN'S mutex relations are applied (after being formulated in terms of tokens).
The semaphores named mutex in each variable of thype item or queue in Figure 4 are used for mutual exclusion.