A distributed system may have multiple, independent resources.

Imagine that process 0

wants to access resource A and process 1 wants to access resource B. Can Ricart and
Agrawala’s algorithm lead to deadlocks? Explain your answer.

Answer: It is subject to basic rules. If it considers access to services in strict sequence, that is, the
system that manages the app may not attempt to access another, so there is no way it can block it
while holding the resource required by another process. The system then has no deadlock. On the
other hand, if process 0 can hold app A and try to access app B, it may be delayed if another process
tries to find it in sequence. The Ricard and Agrawala algorithm itself does not contribute to time
constraints as each resource is managed independently of all the others.