Assigned: Feb. 11
Due: Feb. 20
Suppose that the operations on mutex are omitted from the
solution to the readers/writers problem (Tanenbaum, p. 129,
A. Show how a race condition can occur in which a reader and
a writer are simultaneously accessing the database.
- B. Show how a race condition can occur in which all
processes are forever blocked from accessing the database.
Consider the following sychronization problem: There are three
processes, P, Q, and R. All three are executing a loop from
1 to N. You wish to enforce the condition that no process may
enter the (I+1)st iteration until the other two processes have
completed the Ith iteration. Show how this condition can
be enforced using three semaphores.