ECE 151
Assignment 3
Due Monday May 1
1. a) Describe and compare the centralized algorithm for mutual exclusion
using a coordinator, with the distributed mutual exclusion algorithm
of Ricart and Agrawala.
b) Explain how each of the two algorithms ensures mutual exclusion
when two processes request entry to the critical region at
approximately the same time.
b) How do the algorithms compare in performance, and in load on the
various processors and on the communication medium, under fault free
conditions?
c) How do the algorithms compare when there is a faulty processor
in the system? For each algorithm, how would you handle such a
fault?
