Mutual exclusion
From The Art and Popular Culture Encyclopedia
|
Related e |
|
Featured: |
In computer science, mutual exclusion refers to the requirement of ensuring that no two processes or threads (henceforth referred to only as processes) are in their critical section at the same time. Here, a critical section refers to a period of time when the process accesses a shared resource, such as shared memory. The problem of mutual exclusion was first identified and solved by Edsger W. Dijkstra in his seminal 1965 paper titled: Solution of a problem in concurrent programming control.
[edit]
See also
- Atomicity (programming)
- Concurrency control
- Mutually exclusive events
- Semaphore
- Dining philosophers problem
- Reentrant mutex
- Spinlock
Unless indicated otherwise, the text in this article is either based on Wikipedia article "Mutual exclusion" or another language Wikipedia page thereof used under the terms of the GNU Free Documentation License; or on research by Jahsonic and friends. See Art and Popular Culture's copyright notice.
