Mutual Exclusion
Download as PPTX, PDF•1 like•496 views
The document discusses mutual exclusion, also known as mutex, which ensures that only one process can access shared modifiable data at a time, preventing race conditions and deadlocks. It defines key terms such as critical region, race condition, and deadlock, illustrating the concept with a pictorial representation. The document also references an external source for further reading.
Mutual Exclusion
- 1. MUTUAL EXCLUSION 1 Presented by: Rabin BK BSc.CSIT 3rd Semester
- 3. Also known as Mutex or simply ME in short A way of making sure that if one process is using a shared modifiable data, the other processes will be excluded from doing the same thing It allows only one process to be in the Critical Region 3 Mutual Exclusion
- 4. Race condition A situation in which multiple threads or processes read and write a shared data item and the final result depends on the relative timing of their execution Deadlock A situation in which two or more processes are unable to proceed because each are waiting for one of the others to do something Critical Region It is a part of the program where the access to shared resources is protected during concurrent process It cannot be executed by more than one process 4 Some terminologies
- 5. 5 Pictorial representaion Process A Process B Race condition
- 7. Queries 7