Why mutual exclusion is important

If multiple processors share the same memory, a flag is set to enable and disable the resource acquisition based on availability. The busy-wait mechanism enforces mutex in the software areas. This is furnished with algorithms such as Dekker's algorithm, the black-white bakery algorithm, Szymanski's algorithm, Peterson's algorithm and Lamport's bakery algorithm.

By: Justin Stoltzfus Contributor, Reviewer. By: Satish Balakrishnan. Dictionary Dictionary Term of the Day. Natural Language Processing. Techopedia Terms. Connect with us. Sign up. Term of the Day. Best of Techopedia weekly. A process corresponds to a given computation. That is, given some program, its execution is a process. Sometimes, it is convenient to refer to the program code itself as a process. A process runs on a processor , which is the physical hardware. Several processes can run on the same processor although Skip to main content Skip to table of contents.

This service is more advanced with JavaScript available. Encyclopedia of Algorithms Edition. Editors: Ming-Yang Kao. Contents Search. Concurrent Programming, Mutual Exclusion ; Dijkstra. Authors Authors and affiliations Gadi Taubenfeld. How to cite. Keywords and Synonyms Critical section problem. Concurrency, Synchronization and Resource Allocation A concurrent system is a collection of processors that communicate by reading and writing from a shared memory.

Improve Article. Like Article. Next Building blocks of a Data Model. Recommended Articles. Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide.