Previous | Next --- Slide 29 of 33
Back to Lecture Thumbnails
xiaowend

In this example, P1 and P2 are always busy. But in fact, there are no progress. Neither processor finishes writing.

acappiello

On slide 22, two options are given for when snoop results should be reported. By adding requirements, such as completing a write before releasing exclusive ownership, waiting a fixed number of clocks becomes less feasible. This is because time will have to be added to allow a processor to make a write before responding.