Deadlock Avoidance

• Responses are never delayed by requests waiting for a response

• Responses are guaranteed to be sunk

• Requests will eventually be serviced since the number of responses is bounded by outstanding requests

• Must classify transactions according to deadlock and coherence semantics

  • e.g., ordering of BusRD response (Bdata) and BInval
  • Treat both Bdata and Binval as requests (go in same queue)

Previous slide

Next slide

Back to first slide

View graphic version