l6 - INTERPROCESS SYNCHRONIZATION AND COMMUNICATION Outline...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 INTERPROCESS SYNCHRONIZATION AND COMMUNICATION Outline of the Lecture: Race Condition Critical Section Mutual Exclusion Solution to Critical Section Problem Two process software Solution Multi-process Solution
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Race Condition Race Condition: The situation where, two or more processes are reading or writing some shared data and the result depends on who runs precisely when, is called a race condition. Objective: Avoid Race Condition. Critical Section: The part of the program where a shared variable is accessed is called a critical section. To avoid Race Condition, we must have the following: “If one process is in critical section, other competing processes must be excluded to enter their critical sections, i.e., a process must enter the critical section in a mutually exclusive way.” This is called the problem of Mutual Exclusion .
Background image of page 2
3 Requirements for solving Race Condition Requirements for CS Problem Solutions: 1. MUTUAL EXCLUSION: N two contending
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

l6 - INTERPROCESS SYNCHRONIZATION AND COMMUNICATION Outline...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online