The Critical Section Problem

• n processes are competing to use some shared data.

• Each process has a code segment, called critical section, in which the shared data is accessed.

• Goal: when one process is executing in its critical section, no other process can execute in its critical section.

• Each process looks like this:

Repeat

entry section

critical section - CS

exit section

remainder section - RS

Forever;

Previous slide

Next slide

Back to first slide

View graphic version