Problem

1. What happens if a Munin process modifies a shared variable outside a critical region?

2. Give an example of an in operation in Linda that does not require any searching or hashing to find a match.

3. When Linda is implemented by replicating tuples on multiple machines, a protocol is needed for deleting tuples. Give an example of a protocol that does not yield races when two processes try to delete the same tuple at the same time.

4. Consider an Orca system running on a network with hardware broadcasting. Why does the ratio of read operations to write operations affect the performance?