803 views
0 votes
0 votes
A distributed system using mailboxes has two $IPC$ primitives, send and receive. The latter primitive specifies a process to receive from and blocks if no message from that process is available, even though messages may be waiting from other processes. There are no shared resources, but processes need to communicate frequently about other matters. Is deadlock possible? Discuss.

1 Answer

0 votes
0 votes

Yes, in this case deadlock is possible.

Take a simple resource deadlock graph. Just reinterpret the resources as messages. Like P1 is wating for message M2 from P2. P2 is waiting for message M1 from P1. Since both the waits are blocking, there is a deadlock.

 

Related questions

0 votes
0 votes
1 answer
3